✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
For any given nontrivial graph, explicit formulas are given for the Zagreb coindices of its double graph and $k$-iterated double graph, respectively.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:For a nontrivial graph $G$, its first and second Zagreb coindices are defined as the sum of degree sum of of nonadjacent vertex pairs and the sum of degree product of nonadjacent vertices pairs, respectively.
📊
Temel Bulgular & Veri:Motivated by the work in [1], we study Zagreb coindices of a new kind of composite graph, namely, double graph.
💡
Sonuç & Katkı:For any given nontrivial graph, explicit formulas are given for the Zagreb coindices of its double graph and $k$-iterated double graph, respectively.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Degree · Zagreb indices · Zagreb coindices
Abstract
For a nontrivial graph $G$, its first and second Zagreb coindices are defined as the sum of degree sum of of nonadjacent vertex pairs and the sum of degree product of nonadjacent vertices pairs, respectively. Motivated by the work in [1], we study Zagreb coindices of a new kind of composite graph, namely, double graph. For any given nontrivial graph, explicit formulas are given for the Zagreb coindices of its double graph and $k$-iterated double graph, respectively.
🔖
Bu Makaleye Atıf Yap
Yang, L., Ai, X., Zhang, L. (2016). The Zagreb coindices of a type of composite graph. Hacettepe Journal of Mathematics and Statistics, Volume: 45 Issue: 4. https://ajindex.com/articles/1403127