TY - JOUR

T1 - On a conjecture on a laplacian matrix with distinct integral spectrum

AU - Goldberger, Assaf

AU - Neumann, Michael

PY - 2013

Y1 - 2013

N2 - In a paper Fallat et al. (J Graph Theory 50 (2005), 162-174) consider the question of the existence of simple graphs G on n vertices whose Laplacian matrix L(G) has an integral spectrum consisting of simple eigenvalues only in the range 0,.,n, 0 always being, automatically, one of the eigenvalues. They completely characterize the case when n is one of the eigenvalues, but for the case when n is not, they conjecture that there are no such graphs. In that paper it is shown that, indeed, there are no such graphs for n≤11. In this paper we show that the conjecture is true for n≥6,649,688,933. We actually consider the nonexistence of graphs whose Laplacians are realized by more general spectra λ1≥λ2≥â̄≥λn, with λ1=n-1, λ2≤n-2, λn-2≥2, λn-1=1, and λn=0, subject to certain trace conditions. We show that, indeed, for sufficiently large n such graphs do not exist. Our methods are both graph theoretical and algebraic. In certain cases we refine the Cauchy interlacing theorem. Finally, rather than work with Laplacians which have nonpositive off-Diagonal entries, we transform the problems to the realizability of spectra of nonnegative matrices which we term anti-Laplacians.

AB - In a paper Fallat et al. (J Graph Theory 50 (2005), 162-174) consider the question of the existence of simple graphs G on n vertices whose Laplacian matrix L(G) has an integral spectrum consisting of simple eigenvalues only in the range 0,.,n, 0 always being, automatically, one of the eigenvalues. They completely characterize the case when n is one of the eigenvalues, but for the case when n is not, they conjecture that there are no such graphs. In that paper it is shown that, indeed, there are no such graphs for n≤11. In this paper we show that the conjecture is true for n≥6,649,688,933. We actually consider the nonexistence of graphs whose Laplacians are realized by more general spectra λ1≥λ2≥â̄≥λn, with λ1=n-1, λ2≤n-2, λn-2≥2, λn-1=1, and λn=0, subject to certain trace conditions. We show that, indeed, for sufficiently large n such graphs do not exist. Our methods are both graph theoretical and algebraic. In certain cases we refine the Cauchy interlacing theorem. Finally, rather than work with Laplacians which have nonpositive off-Diagonal entries, we transform the problems to the realizability of spectra of nonnegative matrices which we term anti-Laplacians.

KW - Cauchy Interlacing Theorem

KW - Integral Eigenvalues

KW - Laplacian Matrix

UR - http://www.scopus.com/inward/record.url?scp=84872141200&partnerID=8YFLogxK

U2 - 10.1002/jgt.21638

DO - 10.1002/jgt.21638

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84872141200

SN - 0364-9024

VL - 72

SP - 178

EP - 208

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 2

ER -