Counterexamples to a conjecture of Dias on eigenvalues of chemical graphs

MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY(2010)

引用 0|浏览2
暂无评分
摘要
Chemical graphs (simple, connected graphs with maximum degree no greater than three) with eigenvalues +/-root 8 exist for all orders greater than nine, disproving a conjecture of J.R. Dias that no chemical graph with this pair of eigenvalues exists. In fact, the eigenvalue pair can be achieved with arbitrarily high multiplicity.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要