An extremal problem for the spectral radius of a graph

DOI10.1016/0012-365X(92)90669-7zbMath0767.05057MaRDI QIDQ1201245

Miroslav Fiedler

Publication date: 17 January 1993

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

zbMATH Keywords

eigenvaluesspectral radiusboundsextremal problemvaluation matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

The spectral radius of maximum weighted cycle, Polytopic uncertainty for linear systems: new and old complexity results, Minimum spectral radius of a weighted graph, On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set, Some minimax problems for graphs, Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs

Cites Work

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