Trees, unicyclic, and bicyclic graphs extremal with respect to multiplicative sum Zagreb index

zbMATH Open1289.05235MaRDI QIDQ2856722FDOQ2856722

Publication date: 30 October 2013

Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cited In (24)

Sharp lower bounds on the Narumi-Katayama index of graph operations
Extremal unicyclic graphs with respect to the Sanskruti index
On the bounds of degree-based topological indices of the Cartesian product of \(F\)-sum of connected graphs
The connectivity and the modified second multiplicative Zagreb index of graphs
Zagreb indices of graphs
Title not available (Why is that?)
On multiplicative sum Zagreb index of trees with fixed domination number
Some indices over a new algebraic graph
Introducing new exponential Zagreb indices for graphs
Extremal first leap Zagreb index of \(k\)-generalized quasi-trees
The multiplicative sum Zagreb indices of graphs with given clique number
Multiplicative Zagreb indices and coindices of some derived graphs
Some distance based indices of graphs based on four new operations related to the lexicographic product
Multiplicative Zagreb indices of four new \(\mathcal{F}\)-sums of graphs
Computation of Zagreb indices and Zagreb polynomials of Sierpinski graphs
On the reduced second Zagreb index of graphs
On the multiplicative sum Zagreb index of graphs with some given parameters
Relations between ordinary and multiplicative degree-based topological indices
The hyper-zagreb index for an infinite family of nanostar dendrimer
Multiplicative version of eccentric connectivity index
Computing three topological indices for titania nanotubes \(\mathrm{TiO}_2[m,n]\)
The sharp bounds of Zagreb indices on connected graphs
Degree-based indices computation for special chemical molecular structures using edge dividing method
Lower bounds on the entire Zagreb indices of trees

This page was built for publication: Trees, unicyclic, and bicyclic graphs extremal with respect to multiplicative sum Zagreb index

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