@article{Article_100,

title = {Edge degree Zagreb indices of certain class of trees and their application},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2025},

issue = {1},

issn = { 2783-5456 },

year = {2026},

url = {http://cccs.sgh.ac.ir/Articles/2025/issue 1/1-4-EdgedegreeZagrebindicesofcertainclassoftreesandtheirapplication.pdf},

author = {Harishchandra S. Ramane and Vijayraj S. Kamble and and Aafiyaparveen Madaki},

keywords = {Edge degree of a vertex, Edge degree Zagreb indices, Kragujevac tree, Bistar tree, Tristar tree.},

abstract = {The edge degree of a vertex of a graph $G$ is defined as sum of degrees of all the edges incident to it. In this article, with respect to edge degree of a vertex, we introduce first and second Edge degree Zagreb indices of graph $G$ and are defined as $EDZ_1=\sum_{uv\in E(G)}\left[ {ed_{(u)}+ed_{(v)}}\right] $ and $EDZ_2=\sum_{uv \in E(G)}\left[ {ed_{(u)}\ ed_{(v)}}\right]$ respectively. Later, we compute first and second edge degree Zagreb indices of well known trees such as Kragujevac trees, bistar trees and tristar trees. Further carried out linear regression analysis of first and second edge degree Zagreb indices of underlying molecular graphs of octane isomers which are trees.}

};