Minimizer graphs for a class of extremal problems
From MaRDI portal
Publication:4537559
Recommendations
Cites work
Cited in
(17)- Extremality of degree-based graph entropies
- Maximizing the degree powers of graphs with fixed size
- Existence and uniqueness of solutions to the norm minimum problem on digraphs
- On the extremal Zagreb indices of graphs with cut edges
- Sums of powers of the degrees of a graph
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Area-minimizing minimal graphs over nonconvex domains.
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- 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\)
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Lagrangian graphs, minimizing measures and Mañé's critical values
- Degree powers in \(K_{s,t}\)-minor free graphs
- Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
- A minimum principle for Lagrangian graphs
- Minimax theorems for infinite graphs with the ends as ideal points
- Bipartite graphs with the maximum sum of squares of degrees
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)