✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
In this note, we present new conditions based on energy for Hamiltonain and traceable graphs.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez: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.
📊
Temel Bulgular & Veri:The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the graph.
💡
Sonuç & Katkı:In this note, we present new conditions based on energy for Hamiltonain and traceable graphs.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler: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.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
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