Skip to main content

Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs

Contributed Papers

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

Abstract

In this paper we characterize all finite sequences of ordered pairs of non-negative integers which form the outdegree-indegree sequence of (a) a self-complementary digraph and (b) a self-converse digraph.

Keywords

  • Finite Sequence
  • Pair Sequence
  • Combinatorial Theory
  • Degree Sequence
  • Conjugate Pair

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. W.K. Chen, Applied Graph Theory, North-Holland Publishing Company, Amsterdam, London, 1971.

    MATH  Google Scholar 

  2. C.R.J. Clapham, Potentially self-complementary degree sequences, J. Combinatorial Theory, Ser. B, 20 (1976), 75–79.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. C.R.J. Clapham and D.J. Kleitman, The degree sequences of self-complementary graphs, J. of Combinatorial Theory, Ser. B, 20 (1976), 67–74.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. W.J.R. Eplett, Self-converse tournaments, Canadian Math. Bull., Vol. 22, No. 1 (1979), 23–27.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. F. Harary, Graph Theory, Addison Wesley, New York, 1969.

    MATH  Google Scholar 

  7. D.J. Kleitman and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors, Discrete Math., 6 (1973), 79–88.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. S.B. Rao, Characterization of forcibly self-complementary degree sequences, Submitted for publication.

    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

Das, P. (1981). Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092265

Download citation

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

  • 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