共 31 条
Some Results on Walk Regular Graphs Which Are Cospectral to Its Complement
被引:2
|作者:
Lepovic, Mirko
机构:
[1] Kragujevac, 34000
关键词:
walk regular graph;
strongly regular graph;
conjugate adjacency matrix;
conjugate characteristic polynomial;
D O I:
10.3836/tjm/1279719588
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We say that a regular graph G of order n and degree r >= 1 (which is not the complete graph) is strongly regular if there exist non-negative integers tau and theta such that vertical bar S-i boolean AND S-j vertical bar = tau for any two adjacent vertices i and j, and vertical bar S-i boolean AND S-j vertical bar = theta for any two distinct non-adjacent vertices i and j, where S-k denotes the neighborhood of the vertex k. We say that a graph G of order n is walk regular if and only if its vertex deleted subgraphs G(i) = G \ i are cospectral for i = 1, 2, ... , n. We here establish necessary and sufficient conditions under which a walk regular graph G which is cospectral to its complement (G) over bar is strongly regular.
引用
收藏
页码:223 / 234
页数:12
相关论文