Abstract
A conjecture of Grone and Merris states that for any graph $G$, its Laplacian spectrum, $\Lambda(G)$, is majorized by its conjugate degree sequence, $D^*(G)$. That conjecture prompts an investigation of the relationship between $\Lambda(G)$ and $D^*(G),$ and Merris has characterized the graphs $G$ for which the multisets $\Lambda(G)$ and $D^*(G)$ are equal. In this paper, we provide a constructive characterization of the graphs $G$ for which $\Lambda(G)$ and $D^*(G)$ share all but two elements.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献