scientific article

zbMath1289.05065MaRDI QIDQ2856698

Lu Gan, Yufei Huang, Bo Lian Liu

Publication date: 30 October 2013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (23)

Minimum augmented Zagreb index of \(c\)-cyclic graphs ⋮ Maximal augmented Zagreb index of trees with given diameter ⋮ Unnamed Item ⋮ Some invariants of Jahangir graphs ⋮ The \(k\)-apex trees with minimum augmented Zagreb index ⋮ The augmented Zagreb indices of fluoranthene-type benzenoid systems ⋮ Complete characterization of chemical trees with maximal augmented Zagreb index ⋮ Computation of certain topological properties of para-line graph of honeycomb networks and graphene ⋮ Spectral properties of inverse sum indeg index of graphs ⋮ On topological indices of fractal and Cayley tree type dendrimers ⋮ On structure-sensitivity of degree-based topological indices ⋮ M-Polynomial and topological indices of benzene ring embedded in p-type surface network ⋮ Redefined Zagreb indices of Rhombic, triangular, Hourglass and Jagged-rectangle benzenoid systems ⋮ Bounds for the augmented Zagreb and the atom-bond connectivity indices ⋮ The minimal augmented Zagreb index of \(k\)-apex trees for \(k\in\{1,2,3\}\) ⋮ Extremal graphs with respect to generalized ABC index ⋮ Some new lower bounds for augmented Zagreb index ⋮ Further inequalities between vertex-degree-based topological indices ⋮ Some vertex/edge-degree-based topological indices of \(r\)-apex trees ⋮ Extremal augmented Zagreb index of trees with given numbers of vertices and leaves ⋮ Augmented Zagreb index of trees and unicyclic graphs with perfect matchings ⋮ Unnamed Item ⋮ Unicyclic and bicyclic graphs with minimal augmented Zagreb index

This page was built for publication: