✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
In this note, we present new conditions based on energy for Hamiltonain and traceable graphs.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the graph.
💡
Conclusion & Impact:In this note, we present new conditions based on energy for Hamiltonain and traceable graphs.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Energy · Hamiltonian · Graph
Abstract
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.
Keywords
🔖
Cite This Article
Lİ, R. (2019). Energy Conditions for Hamiltonian and Traceable Graphs. Universal Journal of Mathematics and Applications, Cilt: 2 - Sayı: 1, 33–35. https://ajindex.com/articles/819979