Energy Conditions for Hamiltonicity of Graphs

Guidong Yu, Gaixiang Cai, Miaolin Ye and Jinde Cao

Discrete Dynamics in Nature and Society, 2014, vol. 2014, 1-6

Abstract:

Let be an undirected simple graph of order . Let be the adjacency matrix of , and let be its eigenvalues. The energy of is defined as . Denote by a bipartite graph. In this paper, we establish the sufficient conditions for having a Hamiltonian path or cycle or to be Hamilton-connected in terms of the energy of the complement of , and give the sufficient condition for having a Hamiltonian cycle in terms of the energy of the quasi-complement of .

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2014/305164.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2014/305164.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:305164

DOI: 10.1155/2014/305164

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().