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

DOI10.1007/s10440-009-9534-1zbMath1190.92050MaRDI 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

clique; Zagreb index; cut vertex; Randić connectivity index; pendent path

Mathematics Subject Classification ID

05C05: Trees

05C90: Applications of graph theory

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

05C40: Connectivity

Related Items

On the reduced second Zagreb index of trees, Unnamed Item, Unnamed Item, Unnamed Item, 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, Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number, 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, Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs, The Zagreb indices of four operations on graphs, On the sum of squares of degrees and products of adjacent degrees, 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, Zagreb indices and multiplicative Zagreb indices of Eulerian graphs, On the monotonicity of topological indices and the connectivity of a graph, The Zagreb indices of graphs based on four new operations related to the lexicographic product, The domination complexity and related extremal values of large 3D torus, 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, Computation on the difference of Zagreb indices of maximal planar graphs with diameter two, The total eccentricity sum of non-adjacent vertex pairs in graphs, On the extremal cacti of given parameters with respect to the difference of Zagreb indices, Extremal Zagreb indices of graphs with a given number of cut edges, Multiplicative Zagreb indices of cacti

Uses Software

• AutoGraphiX

Cites Work

• 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
• 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