Minimum vertex covers and the spectrum of the normalized Laplacian on trees

Abstract

We show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimum vertex covers. In particular, for the eigenvalue 1, its multiplicity is related to the size of a minimum vertex cover, and zero entries of its eigenvectors correspond to vertices in minimum vertex covers; while for eigenvalues near 1, their distance to 1 can be estimated from minimum vertex covers; and for the largest eigenvalue smaller than 1, the sign graphs of its eigenvectors take vertices in a minimum vertex cover as representatives.

Published version

Cited by in corpus (4)

• Spectral classes of regular, random, and empirical graphs
• A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
• Characteristics polynomial of normalized Laplacian for trees
• The normalized Laplacian and related indexes of graphs with edges blew up by cliques