On the maximum Zagreb indices of graphs with \(k\) cut vertices

DOI10.1007/s10440-009-9534-1zbMath1190.92050OpenAlexW1963693830MaRDI QIDQ982233

Qin Zhao, Shuchao Li

Publication date: 6 July 2010

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10440-009-9534-1

zbMATH Keywords

cliqueZagreb indexcut vertexRandić connectivity indexpendent path

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Related Items (26)

Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges ⋮ On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices ⋮ Computation on the difference of Zagreb indices of maximal planar graphs with diameter two ⋮ Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices ⋮ Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter ⋮ Unnamed Item ⋮ The total eccentricity sum of non-adjacent vertex pairs in graphs ⋮ On the reduced second Zagreb index of trees ⋮ Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number ⋮ On the extremal cacti of given parameters with respect to the difference of Zagreb indices ⋮ On the sum of squares of degrees and products of adjacent degrees ⋮ Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs ⋮ Unnamed Item ⋮ Extremal Zagreb indices of graphs with a given number of cut edges ⋮ Zagreb indices and multiplicative Zagreb indices of Eulerian graphs ⋮ Unnamed Item ⋮ On the monotonicity of topological indices and the connectivity of a graph ⋮ The Zagreb indices of four operations on graphs ⋮ The Zagreb indices of graphs based on four new operations related to the lexicographic product ⋮ Eccentric adjacency index of graphs with a given number of cut edges ⋮ On the spectral radius and energy of the weighted adjacency matrix of a graph ⋮ Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices ⋮ The domination complexity and related extremal values of large 3D torus ⋮ Multiplicative Zagreb indices of cacti ⋮ On the multiplicative sum Zagreb index of graphs with some given parameters ⋮ Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of connected graphs with cut vertices
• On the connectivity index of trees
• On the extremal Zagreb indices of graphs with cut edges
• Wiener index of graphs with more than one cut-vertex
• Extremal graphs for weights
• An upper bound on the sum of squares of degrees in a graph
• On the spectral radius of graphs with cut vertices
• Maximizing the sum of the squares of the degrees of a graph
• Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
• Sharp bounds for the second Zagreb index of unicyclic graphs
• The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
• Sums of powers of the degrees of a graph
• Randić ordering of chemical trees
• Trees of extremal connectivity index
• Series expansion of the directed percolation probability
• Permanents of graphs with cut vertices
• Minimizer graphs for a class of extremal problems

This page was built for publication: On the maximum Zagreb indices of graphs with \(k\) cut vertices