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.
机构:
Univ Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South AfricaUniv Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South Africa
Henning, Michael A.
Joos, Felix
论文数: 0引用数: 0
h-index: 0
机构:
Univ Ulm, Inst Optimizat & Operat Res, D-89081 Ulm, GermanyUniv Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South Africa
Joos, Felix
Lowenstein, Christian
论文数: 0引用数: 0
h-index: 0
机构:
Univ Ulm, Inst Optimizat & Operat Res, D-89081 Ulm, GermanyUniv Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South Africa
Lowenstein, Christian
Sasse, Thomas
论文数: 0引用数: 0
h-index: 0
机构:
Univ Ulm, Inst Optimizat & Operat Res, D-89081 Ulm, GermanyUniv Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South Africa