A simple approach to order the multiplicative Zagreb indices of connected graphs

zbMATH Open1272.05028MaRDI QIDQ2837166FDOQ2837166

Authors: Mehdi Eliasi 

Publication date: 10 July 2013

Published in: Transactions on Combinatorics (Search for Journal in Brave)

Recommendations

• Comparing the multiplicative Zagreb indices
• scientific article
• scientific article; zbMATH DE number 7274713
• Multiplicative Zagreb indices of trees
• Note on the multiplicative Zagreb indices

zbMATH Keywords

majorizationunicyclic graphsbicyclic graphsmultiplicative Zagreb index

Mathematics Subject Classification ID

Applications of graph theory (05C90) Vertex degrees (05C07) Connectivity (05C40)

Cited In (8)

• Extremal tricyclic, tetracyclic, and pentacyclic graphs with respect to the Narumi–Katayama index
• Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices
• More inequalities for Laplacian indices by way of majorization
• Extremal Trees with Respect to Some Versions of Zagreb Indices Via Majorization
• Title not available (Why is that?)
• Relations between ordinary and multiplicative degree-based topological indices
• COMPARING THE SECOND MULTIPLICATIVE ZAGREB COINDEX WITH SOME GRAPH INVARIANTS
• Title not available (Why is that?)

This page was built for publication: A simple approach to order the multiplicative Zagreb indices of connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2837166)