A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the graph. In this note, we present new conditions based on energy for Hamiltonain and traceable graphs.
Primary Language | English |
---|---|
Subjects | Mathematical Sciences |
Journal Section | Articles |
Authors | |
Publication Date | March 20, 2019 |
Submission Date | August 31, 2018 |
Acceptance Date | November 29, 2018 |
Published in Issue | Year 2019 |
Universal Journal of Mathematics and Applications
The published articles in UJMA are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.