Minimizer graphs for a class of extremal problems
From MaRDI portal
Publication:4537559
DOI10.1002/JGT.10025zbMATH Open0990.05077OpenAlexW4234061782MaRDI QIDQ4537559FDOQ4537559
Authors: Dan Stefanica, Dan 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
Recommendations
Cites Work
Cited In (17)
- 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
- Area-minimizing minimal graphs over nonconvex domains.
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- On the extremal Zagreb indices of graphs with cut edges
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- Extremality of degree-based graph entropies
- Minimax theorems for infinite graphs with the ends as ideal points
- Lagrangian graphs, minimizing measures and Mañé's critical values
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- A minimum principle for Lagrangian graphs
- Maximizing the degree powers of graphs with fixed size
- Sums of powers of the degrees of a graph
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Bipartite graphs with the maximum sum of squares of degrees
- Degree powers in \(K_{s,t}\)-minor free graphs
- Existence and uniqueness of solutions to the norm minimum problem on digraphs
This page was built for publication: Minimizer graphs for a class of extremal problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537559)