Skip to main content

Graphic sequences

Invited Addresses

Part of the Lecture Notes in Mathematics book series (LNM,volume 748)

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.

Keywords

  • Type Sequence
  • Directed Edge
  • Simple Graph
  • Generalize Graph
  • Switching Operation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bäbler, Über eine spezielle Klasse Euler'sche Graphen, Comment. Math. Helv., 27 (1953), 81–100.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. C. Berge, Theory of Graphs and Its Applications (Methuen, London, 1962).

    MATH  Google Scholar 

  3. W.K. Chen, On the realization of a (p,s)-digraph with prescribed degrees, J. Franklin Inst., 281 (1966), 406–422.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. W.K. Chen, Applied Graph Theory (North Holland, Amsterdam, 2nd revised edn., 1976).

    Google Scholar 

  5. 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.

    Google Scholar 

  6. R.B. Eggleton and D.A. Holton, The graph of type (0,∞,∞) realizations of a graphic sequence, this volume.

    Google Scholar 

  7. P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices (in Hungarian), Mat. Lapok, 11 (1960), 264–274.

    MATH  Google Scholar 

  8. D.R. Fulkerson, Zero-one matrices with zero trace, Pacific J. Math., 10 (1960), 831–836.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. D. Gale, A theorem on flows in networks, Pacific J. Math., 7 (1957), 1073–1082.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. 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.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. 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.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. S.L. Hakimi, On the degrees of the vertices of a directed graph, J. Franklin Inst., 279 (1965), 290–308.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. V. Havel, A remark on the existence of finite graphs (in Czech), Časopis Pěst. Mat., 80 (1955), 477–480.

    MathSciNet  MATH  Google Scholar 

  14. V.V. Menon, On the existence of trees with given degrees, Sankhyā, Ser. A., 26 (1964), 63–68.

    MathSciNet  MATH  Google Scholar 

  15. H.J. Ryser, Combinatorial properties of matrices of zeros and ones, Can. J. Math., 9 (1957), 371–377.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. J.K. Senior, Partitions and their representative graphs, Amer. J. Math., 73 (1951), 663–689.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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