Skip to main content

Hamiltonian of Line Graph under Condition of Constraint

  • Conference paper
  • First Online:
Informatics in Control, Automation and Robotics

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 132))

  • 1151 Accesses

Abstract

In this paper, a D-closed trail problem for a class of the graph G under condition of constraint is discussed. We prove line graph L(G) of G is a Hamiltonian graph by using the method of induced sub-graph’s degree analysis. The main result of this paper is that let G be a simple connected, almost bridgeless graph of order n≥3,GK 1,n − 1, Q 1 and Q 2, if d(I)≥2n-6 for each induced sub-graph I isomorphic to P 4, then, G has a D-closed trail. Accordingly, line graph L(G) of G is a Hamiltonian graph.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. Benhcine, A., Clark, L., Kohlar, N., Veldman, H.J.: On Circuits and Pancyclic line graph. J. Graph Theory 3(10), 411–425 (1986)

    Article  Google Scholar 

  2. Zhao, L.C., Liu, C.F.: A Sufficient Condition for Hamiltonian Line Graph. Applied Mathematics (1), 22–26 (1990)

    Google Scholar 

  3. Harary, F., St. Nash-Williams, C.J.A.: On euleriam and hamiltonian graph and line graph. Canada Math. Bull 8, 701–710 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  4. Veldman, H.J.: A Result on Hamiltonian Line Graphs lnvolving Restrictions on lnduced Subgraphs. J. Graph Theory 12(3), 413–420 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  5. Zhao, L.C., Liu, C.F., Wang, H.: Note on Hamiltonian Line Graph. Journal of Applied Mathematics 9(1), 17–20 (1986)

    MATH  Google Scholar 

  6. Clark, L.: On Hamiltonian line graph. J. Graph Theory 8(3), 303–307 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Zhao, L.C., Liu, C.F.: A Sufficient Condition for Hamiltonian Line Graph. Journal of Qufu Normal University 15(4), 15–20 (1989)

    MathSciNet  MATH  Google Scholar 

  8. Liu, C.F.: On Hamiltonian Line Graph in Graph K3-Free. Journal of Shenyang Golden University 13(4), 383–386 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong-Zhi Kan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kan, YZ. (2011). Hamiltonian of Line Graph under Condition of Constraint. In: Tan, H. (eds) Informatics in Control, Automation and Robotics. Lecture Notes in Electrical Engineering, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25899-2_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25899-2_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25898-5

  • Online ISBN: 978-3-642-25899-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics