On the maximum Zagreb indices of graphs with k cut vertices
From MaRDI portal
Publication:982233
Recommendations
- On the extremal Zagreb indices of graphs with cut edges
- Extremal Zagreb indices of graphs with a given number of cut edges
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- scientific article; zbMATH DE number 6098676
Cites work
- scientific article; zbMATH DE number 398961 (Why is no real title available?)
- scientific article; zbMATH DE number 1330692 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 5251354 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- scientific article; zbMATH DE number 2242494 (Why is no real title available?)
- scientific article; zbMATH DE number 2239308 (Why is no real title available?)
- scientific article; zbMATH DE number 2239309 (Why is no real title available?)
- A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs
- An upper bound on the sum of squares of degrees in a graph
- Enumeration of connected graphs with cut vertices
- Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
- Extremal graphs for weights
- Further properties of Zagreb indices
- Graph theory with applications
- Graphs of extremal weights
- Maximizing the sum of the squares of the degrees of a graph
- Minimizer graphs for a class of extremal problems
- On acrylic and unicyclic conjugated graphs with maximum Zagreb indices
- On history of the Randić index and emerging hostility toward chemical graph theory
- On the connectivity index of trees
- On the extremal Zagreb indices of graphs with cut edges
- On the spectral radius of graphs with cut vertices
- Permanents of graphs with cut vertices
- Randić ordering of chemical trees
- Recent results in the theory of Randić index.
- Series expansion of the directed percolation probability
- Sharp bounds for the second Zagreb index of unicyclic graphs
- Similarity of molecular descriptors: the equivalence of Zagreb indices and walk counts
- Some estimations of Zagreb indices
- Some theoremes about the Randić connectivity index
- Sums of powers of the degrees of a graph
- The second Zagreb index of acyclic conjugated molecules
- The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
- Trees of extremal connectivity index
- Trees with maximal second Zagreb index and prescribed number of vertices of the given degree
- Upper bounds for Zagreb indices of connected graphs
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Wiener index of graphs with more than one cut-vertex
Cited in
(29)- Trees with the minimal second Zagreb index
- On the reduced second Zagreb index of trees
- Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges
- Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
- Multiplicative Zagreb indices of cacti
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
- Extremal \(F\)-index of a graph with \(k\) cut edges
- On the multiplicative sum Zagreb index of graphs with some given parameters
- On the monotonicity of topological indices and the connectivity of a graph
- Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs
- The Zagreb indices of four operations on graphs
- The connectivity and the modified second multiplicative Zagreb index of graphs
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- scientific article; zbMATH DE number 6098676 (Why is no real title available?)
- On the sum of squares of degrees and products of adjacent degrees
- On the extremal Zagreb indices of graphs with cut edges
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Eccentric adjacency index of graphs with a given number of cut edges
- On the extremal cacti of given parameters with respect to the difference of Zagreb indices
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Extremal Zagreb indices of graphs with a given number of cut edges
- The total eccentricity sum of non-adjacent vertex pairs in graphs
- 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
- The domination complexity and related extremal values of large 3D torus
- The Zagreb indices of graphs based on four new operations related to the lexicographic product
- 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
This page was built for publication: On the maximum Zagreb indices of graphs with \(k\) cut vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982233)
