On a Spectral Lower Bound of Treewidth

Tatsuya Gima,Tesshu Hanaka, Kohei Noro,Hirotaka Ono,Yota Otachi

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS（2024）

引用 0|浏览2

暂无评分

摘要

In this letter, we present a new lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. Our bound slightly improves the lower bound given by Chandran and Subramanian

查看译文

关键词

treewidth,algebraic connectivity,Laplacian matrix,eigenvalue

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要