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

MaRDI QIDQ2837166zbMATH OpenFDO

Authors Mehdi Eliasi

Publication date 10 July 2013

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

zbMATH Keywords

bicyclic graphsmajorizationmultiplicative Zagreb indexunicyclic graphs

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(10)

• Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices
• Multiplicative versions of first Zagreb index
• Extermal trees with respect to some versions of Zagreb indices via majorization
• More inequalities for Laplacian indices by way of majorization
• Some remarks on the arithmetic-geometric index
• Relations between ordinary and multiplicative degree-based topological indices
• scientific article; zbMATH DE number 7274713 (Why is no real title available?)
• COMPARING THE SECOND MULTIPLICATIVE ZAGREB COINDEX WITH SOME GRAPH INVARIANTS
• Extremal tricyclic, tetracyclic, and pentacyclic graphs with respect to the Narumi-Katayama index
• Comparing the multiplicative Zagreb indices

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)