Skip to main content
SpringerLink
Log in

Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible

  • Published:
Indian Journal of Pure and Applied Mathematics Aims and scope Submit manuscript

Abstract

A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. It is shown that all distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. A. Bondy and R. L. Hemminger, Graph reconstruction — A survey J. Graph Theory, 1 (1977), 227–268.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. A. Bondy, A graph reconstructor’s manual, in Surveys in Combinatorics (Proceedings of British Combinatorial Conference) London Mathematical Society Lecture Notes, 116 (1991), 221–252.

    Google Scholar 

  3. Fred Buckley and Frank Harary, Distance in graphs, Addison-Wesley, 1990.

    MATH  Google Scholar 

  4. P. J. Cameron, Stories from the age of reconstruction Congr. Numer., 113 (1996), 31–41.

    MathSciNet  MATH  Google Scholar 

  5. S. K. Gupta, Pankaj Mangal, and Vineet Paliwal, Some work towards the proof of the reconstruction conjecture Discrete Math., 272 (2003), 291–296.

    Article  MathSciNet  MATH  Google Scholar 

  6. J. Lauri and R. Scapellato, Topics in graph automorphisms and reconstruction, Cambridge University Press, 2003.

    MATH  Google Scholar 

  7. B. Manvel, Reconstruction of graphs-progress and prospects Congr. Numer., 63 (1988), 177–187.

    MathSciNet  MATH  Google Scholar 

  8. S. Ramachandran and S. Monikandan, Graph reconstruction conjecture: Reductions using complement, connectivity and distance Bull. Inst. Combin. Appl., 56 (2009), 103–108.

    MathSciNet  MATH  Google Scholar 

  9. P. K. Stockmeyer, The falsity of the reconstruction conjecture for tournaments J. Graph Theory, 1 (1977), 19–25.

    Article  MathSciNet  MATH  Google Scholar 

  10. W. T. Tutte, All the King’s horses, graph theory and related topics (Proc. Conf. in honor of W.T. Tutte’s 60th birthday), eds. J. A. Bondy and U. S. R. Murty, Academic Press, New York (1976), 15–33.

    Google Scholar 

  11. Yang Yongzhi, The reconstruction conjecture is true if all 2-connected graphs are reconstructible J. Graph Theory, 12(2) (1988), 237–243.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli, 627 012, Tamil Nadu, India

    P. Devi Priya & S. Monikandan

Authors
  1. P. Devi Priya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Monikandan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to P. Devi Priya or S. Monikandan.

Additional information

Monikandan’s research is supported by the SERB-DST, Govt. of India. Grant No. EMR/2016/000157.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Devi Priya, P., Monikandan, S. Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible. Indian J Pure Appl Math 50, 477–484 (2019). https://doi.org/10.1007/s13226-019-0339-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13226-019-0339-2

Key words

Search

Navigation