Sharp Bounds for the Second Zagreb Index of Unicyclic Graphs

By Zheng Yan, Huiqing Liu, H. Liu. 2007

54 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/5e71e24623cb54398926f2916da191a9c5f1c726

How researchers see this paper

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

In Computational Theory and Mathematics

1. Shuchao Li
2. Qin Zhao
3. K. C. Das
4. Hanyuan Deng

In Geometry and Topology

1. K. C. Das
2. Hanyuan Deng

In Organic Chemistry

1. K. C. Das
2. Hanyuan Deng

Citations in the corpus

• 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].”
• A Unified Approach to the Extremal Zagreb Indices for Trees, Unicyclic Graphs and Bicyclic Graphs 1 (2007, methodology): “[15] characterized the graphs with the smallest and largest M2 among all unicyclic graphs.”
• On Comparing Zagreb Indices of Graphs (2012, result): “Some recent results on the Zagreb indices are reported in [6], [10], [32]-[35], where also references to the previous mathematical research in this area can be found.”