共 50 条
On Integral Graphs with Few Cycles
被引:0
|作者:
G. R. Omidi
机构:
[1] Isfahan University of Technology,Department of Mathematical Sciences
[2] Institute for Research in Fundamental Sciences (IPM),School of Mathematics
来源:
关键词:
Integral graphs;
Complete matchings;
Bipartite graphs;
05C50;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
A graph is called integral if the spectrum of its adjacency matrix has only integer eigenvalues. In this paper, all integral graphs with at most two cycles (trees, unicyclic and bicyclic graphs) with no eigenvalue 0 are identified. Moreover, we give some results on unicyclic integral graphs with exactly one eigenvalue 0.
引用
收藏
页码:841 / 849
页数:8
相关论文