Energy Conditions for Hamiltonicity of Graphs
Joint Authors
Cai, Gaixiang
Cao, Jinde
Yu, Guidong
Ye, Miaolin
Source
Discrete Dynamics in Nature and Society
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-03-06
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
Let G be an undirected simple graph of order n.
Let A(G) be the adjacency matrix of G, and let μ1(G)≤μ2(G)≤⋯≤μn(G) be its eigenvalues.
The energy of G is defined as ℰ(G)=∑i=1n|μi(G)|.
Denote by GBPT a bipartite graph.
In this paper, we establish the sufficient conditions for G having a Hamiltonian path or cycle or to be Hamilton-connected in terms of the energy of the complement of G, and give the sufficient condition for GBPT having a Hamiltonian cycle in terms of the energy of the quasi-complement of GBPT.
American Psychological Association (APA)
Yu, Guidong& Cai, Gaixiang& Ye, Miaolin& Cao, Jinde. 2014. Energy Conditions for Hamiltonicity of Graphs. Discrete Dynamics in Nature and Society،Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-461922
Modern Language Association (MLA)
Yu, Guidong…[et al.]. Energy Conditions for Hamiltonicity of Graphs. Discrete Dynamics in Nature and Society No. 2014 (2014), pp.1-6.
https://search.emarefa.net/detail/BIM-461922
American Medical Association (AMA)
Yu, Guidong& Cai, Gaixiang& Ye, Miaolin& Cao, Jinde. Energy Conditions for Hamiltonicity of Graphs. Discrete Dynamics in Nature and Society. 2014. Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-461922
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-461922