Skip to main content

Characterization of potentially connected integer-pair sequences

Contributed Papers

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

Abstract

Given a pseudograph, multigraph or graph G, we can associate with it a sequence of unordered integer-pairs SG=(c1, c2, …, cq), where q=|E(G)|, constructed as follows: If the edges of G are labelled 1,2, …, q, then for the sth edge (u,v) of G, cs=(as, bs) where as, bs are the degrees of u and v. An integer-pair sequence S is said to be graphic if there exists a graph G for with SG=S. In this paper we characterize potentially connected integer-pair sequences.

Keywords

  • Induction Hypothesis
  • Connected Graph
  • Distinct Component
  • Multiple Edge
  • Single Vertex

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   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
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. S.L. Hakimi and A.N. Patrines, Relations between graphs and integer-pair sequences, Discrete Mathematics, Vol. 15, (1976), 347–358.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. F. Harary, Graph Theory, (Addison-Wesley, Reading, Mass., 1969).

    MATH  Google Scholar 

  3. S.B. Rao and A. Taneja, Characterization of unipseudographic and unimultigraphic integer-pair sequences, Tech. Report No. 8/79, Indian Statistical Institute, Calcutta.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Achuthan, N. (1981). Characterization of potentially connected integer-pair sequences. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092259

Download citation

  • DOI: https://doi.org/10.1007/BFb0092259

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive