Star complement;
adjacency matrix;
graph eigenvalues;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G be a graph of order n and let mu be an eigenvalue of multiplicity m. A star complement for mu in G is an induced subgraph of G of order n in with no eigenvalue A. Some general observations concerning graphs with the complete tripartite graph K-r,K-s,K-t as a star complement. We study the maximal regular graphs which have K-n,K-n,K-n as a star complement for eigenvalue mu. The results include a complete analysis of the regular graphs which have Kn,n,n as a star complement for 1. It turns out that some well known strongly regular graphs are uniquely determined by such a star complement.
机构:
Univ Stirling, Math & Stat Grp, Dept Math & Comp Sci, Stirling FK9 4LA, ScotlandUniv Stirling, Math & Stat Grp, Dept Math & Comp Sci, Stirling FK9 4LA, Scotland