Some minimax problems for graphs

DOI10.1016/0012-365X(93)90538-5zbMath0786.05023MaRDI QIDQ1309451

Miroslav Fiedler

Publication date: 20 December 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

distancediameterconnectivitytreesradius

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Related Items (2)

Old and new results on algebraic connectivity of graphs ⋮ A survey of automated conjectures in spectral graph theory

Cites Work

• An extremal problem for the spectral radius of a graph
• Absolute algebraic connectivity of trees
• A minimax problem for graphs and its relation to generalized doubly stochastic matrices
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some minimax problems for graphs