✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Finally, we correct the number of extremal chemical trees on 15 vertices.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:The forgotten topological index is defined as the sum of cubes of the degrees of the vertices of the molecular graph $G.$ In this paper, we obtain, analyze, and compare various lower bounds for the forgotten topological index involving the number of vertices, edges, and maximum and minimum vertex degree.
📊
Key Findings & Data:Then we give Nordhaus--Gaddum-type inequalities for the forgotten topological index and coindex.
💡
Conclusion & Impact:Finally, we correct the number of extremal chemical trees on 15 vertices.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:First Zagreb index · second Zagreb index · forgotten topological index
Abstract
The forgotten topological index is defined as the sum of cubes of the degrees of the vertices of the molecular graph $G.$ In this paper, we obtain, analyze, and compare various lower bounds for the forgotten topological index involving the number of vertices, edges, and maximum and minimum vertex degree. Then we give Nordhaus--Gaddum-type inequalities for the forgotten topological index and coindex. Finally, we correct the number of extremal chemical trees on 15 vertices.
🔖
Cite This Article
ELUMALAI, S., MANSOUR, T., ROSTAMI, M. A. (2022). On the bounds of the forgotten topological index. Turkish Journal of Mathematics, Cilt: 41 - Sayı: 6, 1687–1702. https://ajindex.com/articles/607979