Skip to main content
SpringerLink
Log in

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2009)

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

Included in the following conference series:

Abstract

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. In this paper a structural description for unigraphs is introduced: vertex set is partitioned into three disjoint sets while edge set is divided into two different classes. This characterization allows us to design a linear time recognition algorithm that works recursively pruning the degree sequence of the graph. The algorithm detects two particular graphs whose superposition generates the given unigraph.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Calamoneri, T., Petreschi, R.: λ-Coloring Matrogenic Graphs. Discrete Applied Mathematics 154(17), 2445–2457 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chvatal, V., Hammer, P.: Aggregation of inequalities integer programming. Ann. Discrete Math. 1, 145–162 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ding, G., Hammer, P.: Matroids arisen from matrogenic graphs. Discrete Mathematics 165-166(15), 211–217 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Foldes, S., Hammer, P.: Split graphs. In: Proc. 8th South-East Conference on Combinatorics, Graph Theory and Computing, pp. 311–315 (1977)

    Google Scholar 

  5. Foldes, S., Hammer, P.: On a class of matroid producing graphs. Colloq. Math. Soc. J. Bolyai (Combinatorics) 18, 331–352 (1978)

    MathSciNet  MATH  Google Scholar 

  6. Hakimi, S.L.: On realizability of a set of integers and the degrees of the vertices of a linear graph. J. Appl. Math. 10/ 11, 496–506/ 165–147 (1962)

    MathSciNet  MATH  Google Scholar 

  7. Johnson, R.H.: Simple separable graphs. Pacific Journal Math. 56(1), 143–158 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kleiman, D., Li, S.-Y.: A Note on Unigraphic Sequences. Studies in Applied Mathematics, LIV(4), 283–287 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  9. Koren, M.: Sequences with unique realization by simple graphs. J. of Combinatorial theory ser. B 21, 235–244 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Ann. Discrete Math., vol. 56. North-Holland, Amsterdam (1995)

    MATH  Google Scholar 

  11. Marchioro, P., Morgana, A., Petreschi, R., Simeone, B.: Degree sequences of matrogenic graphs. Discrete Math. 51, 47–61 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  12. Nikolopoulos, S.D.: Recognizing Cographs And Threshold Graphs through a classification of their edges. Information Processing Letters 75, 129–139 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Orlin, J.B.: The minimal integral separator of a threshold graph. Ann. Discrete Math. 1, 415–419 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  14. Suzdal, S., Tyshkevich, R.: (P,Q)-decomposition of graphs. Tech. Rep. Rostock: Univ. Fachbereich Informatik, II, 16 S (1999)

    Google Scholar 

  15. Tyshkevich, R.: Decomposition of graphical sequences and unigraphs. Discrete Math. 220, 201–238 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Tyshkevich, R.: Once more on matrogenic graphs. Discrete Math. 51, 91–100 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Univ. of Rome “Sapienza” - Italy, via Salaria 113, 00198, Roma, Italy

    Alessandro Borri, Tiziana Calamoneri & Rossella Petreschi

Authors
  1. Alessandro Borri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tiziana Calamoneri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rossella Petreschi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, 700 108, Kolkata, India

    Sandip Das

  2. Japan Advanced Institute of Science and Technology, 923-1292, Ishikawa, Japan

    Ryuhei Uehara

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borri, A., Calamoneri, T., Petreschi, R. (2009). Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00202-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00201-4

  • Online ISBN: 978-3-642-00202-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation