Energy Conditions for Hamiltonian and Traceable Graphs
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 condition...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Emrah Evren KARA
2019-03-01
|
| Series: | Universal Journal of Mathematics and Applications |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/download/article-file/675327 |
| Summary: | 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. |
|---|---|
| ISSN: | 2619-9653 |