Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue

Electronic Journal Of Combinatorics

L. Emilio Allem¹ 

关键词: Graphs;    Laplacian matrix;    Laplacian eigenvalues;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The parameter $\sigma(G)$ of a graph $G$ stands for the number of Laplacian eigenvalues greater than or equal to the average degree of $G$. In this work, we address the problem of characterizing those graphs $G$ having $\sigma(G)=1$. Our conjecture is tha

【 授权许可】

Others