Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number

DOI10.1016/j.mcm.2011.07.007zbMath1234.05061OpenAlexW2034177058MaRDI QIDQ410007

Qin Zhao, Shuchao Li

Publication date: 15 April 2012

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2011.07.007

zbMATH Keywords

perfect matchingbicyclic graphproduct of degrees of adjacent verticessum of squares of vertex degreesZagreb indices

Mathematics Subject Classification ID

Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Vertex degrees (05C07)

Related Items (9)

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 ⋮ Extremal Zagreb indices of graphs with a given number of cut edges ⋮ The Zagreb indices of four operations on graphs ⋮ The Zagreb indices of graphs based on four new operations related to the lexicographic product ⋮ Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices ⋮ On the first and second Zagreb indices of quasi unicyclic graphs ⋮ Further results on the reciprocal degree distance of graphs ⋮ Extremal tetracyclic graphs with respect to the first and second Zagreb indices

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
• Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
• On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• 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
• Extremal graphs for weights
• On the spectral radius of unicyclic graphs with perfect matchings
• 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
• Sharp bounds for the second Zagreb index of unicyclic graphs
• Sums of powers of the degrees of a graph
• Randić ordering of chemical trees
• Trees of extremal connectivity index
• Minimizer graphs for a class of extremal problems

This page was built for publication: Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number