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...
| Published in: | Universal Journal of Mathematics and Applications |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Emrah Evren KARA
2019-03-01
|
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/download/article-file/675327 |