Abstract
Given a (molecular) graph, the first multiplicative Zagreb index Π 1 is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index Π 2 is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs G n , k having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in G n , k are provided. We also provide these graphs with the largest and smallest Π 1 ( G ) and Π 2 ( G ) in G n , k .
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference37 articles.
1. The Szeged and the Wiener index of graphs
2. Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons
3. On the origin of two degree-based topological indices;Gutman;Bull. Acad. Serbe Sci. Arts,2014
4. Novel molecular descriptors based on functions of new vertex degrees;Todeschini,2010
5. New local vertex invariants and molecular descriptors based on functions of the vertex degrees;Todeschini;MATCH Commun. Math. Comput. Chem.,2010
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献