Laplacian distribution and domination

From MaRDI portal
Publication:1684945



Abstract: Let mG(I) denote the number of Laplacian eigenvalues of a graph G in an interval I, and let gamma(G) denote its domination number. We extend the recent result mG[0,1)leqgamma(G), and show that isolate-free graphs also satisfy gamma(G)leqmG[2,n]. In pursuit of better understanding Laplacian eigenvalue distribution, we find applications for these inequalities. We relate these spectral parameters with the approximability of gamma(G), showing that fracgamma(G)mG[0,1)otinO(logn). However, gamma(G)leqmG[2,n]leq(c+1)gamma(G) for c-cyclic graphs, cgeq1. For trees T, gamma(T)leqmT[2,n]leq2gamma(G).




Cites work









This page was built for publication: Laplacian distribution and domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1684945)