A minimax problem for graphs and its relation to generalized doubly stochastic matrices

DOI10.1080/03081089008817989zbMath0748.05065OpenAlexW2008512148MaRDI QIDQ4712772

Miroslav Fiedler

Publication date: 25 June 1992

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089008817989

zbMATH Keywords

bipartite graphsdoubly stochastic matriceseigenvalue of the Laplacianminimax problem for graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Stochastic matrices (15B51)

Related Items (5)

Minimum spectral radius of a weighted graph ⋮ Laplace eigenvalues of graphs---a survey ⋮ An extremal problem for the spectral radius of a graph ⋮ Some minimax problems for graphs ⋮ Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs

Cites Work

• Absolute algebraic connectivity of trees
• Integer Programming: Methods, Uses, Computations

This page was built for publication: A minimax problem for graphs and its relation to generalized doubly stochastic matrices