Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
From MaRDI portal
Publication:608279
DOI10.1016/j.dam.2010.08.005zbMath1215.05038MaRDI QIDQ608279
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.005
05C07: Vertex degrees
Related Items
On the first and second Zagreb indices of quasi unicyclic graphs, Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number, Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs, Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index, Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices, On the extremal cacti of given parameters with respect to the difference of Zagreb indices
Cites Work
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- On the connectivity index of trees
- On the extremal Zagreb indices of graphs with cut edges
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- An upper bound on the sum of squares of degrees in a graph
- 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
- Sums of powers of the degrees of a graph
- Trees of extremal connectivity index
- 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