Minimizer graphs for a class of extremal problems

DOI10.1002/JGT.10025MaRDI QIDQ4537559zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

threshold graphweight

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Graphs of extremal weights
• Graphs of fixed order and size with maximal \(A_\alpha\)-index
• Minimizing the least eigenvalue of graphs with fixed order and size
• A linear-programming approach to the generalized Randić index
• scientific article; zbMATH DE number 2192148

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Threshold graphs and related topics

Cited in

(20)

• Lagrangian graphs, minimizing measures and Mañé's critical values
• Minimax theorems for infinite graphs with the ends as ideal points
• Area-minimizing minimal graphs over nonconvex domains.
• Degree powers in \(K_{s,t}\)-minor free graphs
• Existence and uniqueness of solutions to the norm minimum problem on digraphs
• A minimum principle for Lagrangian graphs
• Sums of powers of the degrees of a graph
• Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
• Bipartite graphs with the maximum sum of squares of degrees
• Extremality of degree-based graph entropies
• 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
• Maximizing the degree powers of graphs with fixed size
• Counting substructures and eigenvalues. II: Quadrilaterals
• Maximal spectral radius of minimally k-(edge)-connected graphs
• Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs
• 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 extremal Zagreb indices of graphs with cut edges
• On the maximum Zagreb indices of graphs with \(k\) cut vertices

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)