Linear and Multilinear Algebra · 1990 · 28 citations · 3 references
ComputingComputer ScienceAlgorithmsCombinatoricsComputational GeometryDirected Acyclic GraphsGraph AlgorithmsGraph TheoryEigenvalue BoundsSpectral Graph Theory
The inverse of a graph with the spectrum λ 1, λ 1, …λ n (λ 1≠0) is a graph with the spectrum 1/λ1,1/λ2,…,1/λ n ,.We present a purely graph-theoretic construction of the inverse ol a tree with a perfect matening. We apply this method for deriving results concerning the least nonnegative eigenvalue of a tree (called the dual index of a tree), including the best possible upper bound for the dual index of a tree in terms of a the number of its vertices.
3
László Lovász, J. Pelikán · Periodica Mathematica Hungarica · 1973 · 237 citations
Chris Godsil · COMBINATORICA · 1985 · 87 citations