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.
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Makaleler |
Yazarlar | |
Yayımlanma Tarihi | 20 Mart 2019 |
Gönderilme Tarihi | 31 Ağustos 2018 |
Kabul Tarihi | 29 Kasım 2018 |
Yayımlandığı Sayı | Yıl 2019 Cilt: 2 Sayı: 1 |
Universal Journal of Mathematics and Applications
The published articles in UJMA are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.