Skip to main content
SpringerLink
Log in

Optimally Balanced Forward Degree Sequence

  • Conference paper
Book cover Computing and Combinatorics (COCOON 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3595))

Included in the following conference series:

  • 1800 Accesses

Abstract

Forward degree seqences, arising from orderings of the vertices in a graph, carry a lot of vital information about the graph. In this paper, we focus our work on two special classes of forward degree sequences, which we named balanced and strongly balanced. Our main result is to prove that any chordal graph has a strongly balanced forward degree sequence and any graph with all degrees at most 3 has a balanced forward degree sequence. Moreover, we show that the (strongly) balanced forward degree sequence can be computed in polynomial time in the above cases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bollobás, B.: Modern Graph Theory. Springer, New York (1998)

    Book  MATH  Google Scholar 

  2. Erdos, P., Gallai, T.: Graphs with Prescribed Degrees of Vertices, Mat. Lapok 11, 264–274 (1960)

    Google Scholar 

  3. Hakimi, S.: On the Realizability of a Set of Integers as Degrees of the Vertices of a Graph SIAM J. Appl. Math. 10, 496–506 (1962)

    MathSciNet  MATH  Google Scholar 

  4. Havel, V.: A Remark on the Existence of Finite Graphs. Casopis Pest. Mat. 80, 477–480 (1955)

    MathSciNet  MATH  Google Scholar 

  5. Hoffmann, C.M.: Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol. 136. Springer, Heidelberg (1982)

    MATH  Google Scholar 

  6. Luks, E.M.: Isomorphism of bounded valence can be tested in polynomial time. In: Proc. of the 21st Annual Symposium on Foundations of Computing, pp. 42–49. IEEE, Los Alamitos (1980)

    Google Scholar 

  7. West, D.B.: Introduction to Graph Theory. Prentice Hall, New Jersey (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, USA

    Xiaomin Chen, Mario Szegedy & Lei Wang

Authors
  1. Xiaomin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Szegedy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, X., Szegedy, M., Wang, L. (2005). Optimally Balanced Forward Degree Sequence. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_69

Download citation

  • DOI: https://doi.org/10.1007/11533719_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28061-3

  • Online ISBN: 978-3-540-31806-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation