A Unified Approach to the Extremal Zagreb Indices for Trees, Unicyclic Graphs and Bicyclic Graphs 1

80 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Trees, Unicyclic, and Bicyclic Graphs Extremal with Respect to Multiplicative Sum Zagreb Index ∗ (2012, background): “In particular, Deng [6] gave a unified approach to determine extremal values of Zagreb indices for trees, unicyclic graphs, and bicyclic graphs, respectively.”
On the Maximum Zagreb Indices of Graphs with k Cut Vertices (2010, background): “In fact, investigation of the above problems mainly deal with graphs whose cyclomatic number is at most 2 as the sole objects [15, 18, 30, 35, 40, 47, 51, 55]; Mathematical and computational properties of Zagreb indices have also been considered [17, 27, 43, 56, 57].”
Maximizing the Zagreb indices of (n;m)-graphs 1 (2014, background): “In particular, Deng [9] gave a unified approach to determine extremal values of Zagreb indices for trees, unicyclic, and bicyclic graphs, respectively.”
On the multiplicative Zagreb coindex of graphs (2013, background): “In particular, Deng [7] gave a unified approach to determine extremal values of Zagreb indices for trees, unicyclic graphs and bicyclic graphs, respectively.”
A Unified Approach to Extremal Multiplicative Zagreb Indices for Trees, Unicyclic and Bicyclic Graphs ∗ (2012, background): “In particular, Deng [5] gave a unified approach to determine extremal values of Zagreb indices for trees, unicyclic graphs and bicyclic graphs, respectively.”