Skip to main content
SpringerLink
Log in

A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter

  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1449))

Included in the following conference series:

Abstract

In this paper, we construct a family of graphs denoted by Eye(s) that are 3-regualr, 3-connected, planar, hamiltonian, edge hamiltonian, and also optimal 1-hamiltonian. Furthermore, the diameter of Eye(s) is O(log n), where n is the number of vertices in the graph and to be precise, n = 6(2s − 1) vertices.

This work was supported in part by the National Science Council of the Republic of China under contract NSC86-2213-E009-020.

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.

References

  1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, New York, (1980).

    MATH  Google Scholar 

  2. F.R.K. Chung, Diameters of graphs: Old problems and new results, Proc. 18th South-Eastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 60(1987), 298–319.

    MathSciNet  Google Scholar 

  3. F. Harary and J.P. Hayes, Edge fault tolerance in graphs, Networks, 23(1993), 135–142.

    Article  MathSciNet  Google Scholar 

  4. F. Harary and J.P. Hayes, Node fault tolerance in graphs, Networks, 27(1996), 19–23.

    Article  MathSciNet  Google Scholar 

  5. P. Horák and J. Širáň, On a construction of Thomassen, Graphs and Combinatorics, 2(1986), 347–350.

    Article  MathSciNet  Google Scholar 

  6. K. Mukhopadhyaya and B.P. Sinha, Hamiltonian graphs with minimum number of edges for fault-tolerant topologies, Information Processing Letters, 44(1992), 95–99.

    Article  MathSciNet  Google Scholar 

  7. L. Stacho, Maximally non-hamiltonian graphs of girth 7, Graphs and Combinatorics, 12(1996), 361–371.

    Article  MathSciNet  Google Scholar 

  8. C. Thomassen, Hypohamiltonian and hypotraceable graphs, Discrete Math., 9(1974), 91–96.

    Article  MathSciNet  Google Scholar 

  9. J.J. Wang, C.N. Hung, and L.H. Hsu, Optimal 1-hamiltonian graphs, accepted by Information Processing Letters.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan

    Jeng-Jung Wang & Lih-Hsing Hsu

  2. Institute of Information Science, Academia Sinica, Taipei, Taiwan

    Ting-Yi Sung

  3. Department of Information Management, National Taichung Institute of Commerce, Taichung, Taiwan

    Men-Yang Lin

Authors
  1. Jeng-Jung Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ting-Yi Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lih-Hsing Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Men-Yang Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Science, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Wen-Lian Hsu

  2. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, 06520, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, JJ., Sung, TY., Hsu, LH., Lin, MY. (1998). A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-68535-9_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64824-6

  • Online ISBN: 978-3-540-68535-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation