Minimum spectral radius of a weighted graph

DOI10.1016/0024-3795(92)90249-AzbMath0773.05092MaRDI QIDQ1188417

Svatopluk Poljak

Publication date: 13 August 1992

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

zbMATH Keywords

spectral radiusadjacency matrixweighted graphpolynomial algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

The spectral radius of maximum weighted cycle ⋮ On the (Laplacian) spectral radius of weighted trees with fixed matching number q and a positive weight set ⋮ On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set ⋮ On the spectral radius of weighted trees with fixed diameter and weight set ⋮ On the spectral radius of weighted unicyclic graphs with a positive weight set ⋮ Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• Fractional matchings and the Edmonds-Gallai theorem
• An extremal problem for the spectral radius of a graph
• A minimax problem for graphs and its relation to generalized doubly stochastic matrices
• Paths, Trees, and Flowers

This page was built for publication: Minimum spectral radius of a weighted graph