Minimizer graphs for a class of extremal problems
From MaRDI portal
Publication:4537559
DOI10.1002/jgt.10025zbMath0990.05077OpenAlexW4234061782MaRDI QIDQ4537559
Dan Stefanica, Dan P. Ismailescu
Publication date: 1 July 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10025
Related Items (12)
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 upper bounds on Zagreb indices of bicyclic graphs with a given matching number ⋮ Maximizing the degree powers of graphs with fixed size ⋮ Bipartite graphs with the maximum sum of squares of degrees ⋮ Extremality of degree-based graph entropies ⋮ On the extremal Zagreb indices of graphs with cut edges ⋮ On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\) ⋮ On the maximum Zagreb indices of graphs with \(k\) cut vertices ⋮ Sums of powers of the degrees of a graph ⋮ Sharp bounds for Zagreb indices of maximal outerplanar graphs ⋮ Degree powers in \(K_{s,t}\)-minor free graphs
Cites Work
This page was built for publication: Minimizer graphs for a class of extremal problems
