Integer Laplacian eigenvalues of strictly chordal graphs

arxiv(2020)

引用 0|浏览5
暂无评分
摘要
In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be efficiently implemented. Firstly we review results concerning general graphs showing that the number of universal vertices and the degree of false and true twins provide integer Laplacian eigenvalues and their multiplicities. Afterwards, we prove that many integer Laplacian eigenvalues of a strictly chordal graph are directly related to particular simplicial vertex sets and to the minimal vertex separators of the graph.
更多
查看译文
关键词
chordal graphs,laplacian
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要