✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
For any given nontrivial graph, explicit formulas are given for the Zagreb coindices of its double graph and $k$-iterated double graph, respectively.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:Motivated by the work in [1], we study Zagreb coindices of a new kind of composite graph, namely, double graph.
💡
Conclusion & Impact:For any given nontrivial graph, explicit formulas are given for the Zagreb coindices of its double graph and $k$-iterated double graph, respectively.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables: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.
🔖
Cite This Article
Yang, L., Ai, X., Zhang, L. (2022). The Zagreb coindices of a type of composite graph. Hacettepe Journal of Mathematics and Statistics, Cilt: 45 - Sayı: 4, 1135–1142. https://ajindex.com/articles/530116