Abstract
The notion of degree sequence (sometimes called valence sequence) of a graph is the basic theme in this discussion. Degree sequences are first considered in the context of simple graphs. Subsequently they are generalized to a wider setting which unifies various standard extensions of the definition of graph, and introduces further types of graph in a natural way.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Bäbler, Über eine spezielle Klasse Euler'sche Graphen, Comment. Math. Helv., 27 (1953), 81–100.
C. Berge, Theory of Graphs and Its Applications (Methuen, London, 1962).
W.K. Chen, On the realization of a (p,s)-digraph with prescribed degrees, J. Franklin Inst., 281 (1966), 406–422.
W.K. Chen, Applied Graph Theory (North Holland, Amsterdam, 2nd revised edn., 1976).
R.B. Eggleton, Graphic sequences and graphic polynomials: a report, in Infinite and Finite Sets, Vol. 1, ed. A. Hajnal et al, Colloq. Math. Soc. J. Bolyai 10, (North Holland, Amsterdam, 1975), 385–392.
R.B. Eggleton and D.A. Holton, The graph of type (0,∞,∞) realizations of a graphic sequence, this volume.
P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices (in Hungarian), Mat. Lapok, 11 (1960), 264–274.
D.R. Fulkerson, Zero-one matrices with zero trace, Pacific J. Math., 10 (1960), 831–836.
D. Gale, A theorem on flows in networks, Pacific J. Math., 7 (1957), 1073–1082.
S.L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph I, J. Soc. Indust. Appl. Math., 10 (1962), 496–506.
S.L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph II: Uniqueness, J. Soc. Indust. Appl. Math., 11 (1963), 135–147.
S.L. Hakimi, On the degrees of the vertices of a directed graph, J. Franklin Inst., 279 (1965), 290–308.
V. Havel, A remark on the existence of finite graphs (in Czech), Časopis Pěst. Mat., 80 (1955), 477–480.
V.V. Menon, On the existence of trees with given degrees, Sankhyā, Ser. A., 26 (1964), 63–68.
H.J. Ryser, Combinatorial properties of matrices of zeros and ones, Can. J. Math., 9 (1957), 371–377.
J.K. Senior, Partitions and their representative graphs, Amer. J. Math., 73 (1951), 663–689.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag
About this paper
Cite this paper
Eggleton, R.B., Holton, D.A. (1979). Graphic sequences. In: Horadam, A.F., Wallis, W.D. (eds) Combinatorial Mathematics VI. Lecture Notes in Mathematics, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0102679
Download citation
DOI: https://doi.org/10.1007/BFb0102679
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09555-2
Online ISBN: 978-3-540-34857-3
eBook Packages: Springer Book Archive