Integral circulant graphs

被引:119
作者
So, WS [1 ]
机构
[1] San Jose State Univ, Dept Math, San Jose, CA 95192 USA
关键词
integral graph; circulant graph; graph spectrum;
D O I
10.1016/j.disc.2005.11.006
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this note we characterize integral graphs among circulant graphs. It is conjectured that there are exactly 2(tau(n)-1) non-isomorphic integral circulant graphs on it vertices, Where -1(11) is the number of divisors of n. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:153 / 158
页数:6
相关论文
共 10 条
[1]   DISTRIBUTED LOOP COMPUTER-NETWORKS - A SURVEY [J].
BERMOND, JC ;
COMELLAS, F ;
HSU, DF .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 24 (01) :2-10
[2]  
Biggs N., 1993, ALGEBRAIC GRAPH THEO
[3]   CIRCULANTS AND THEIR CONNECTIVITIES [J].
BOESCH, F ;
TINDELL, R .
JOURNAL OF GRAPH THEORY, 1984, 8 (04) :487-499
[4]  
Bridges WG., 1979, Ars Combinatoria, V8, P143
[5]  
Bussemaker F.C., 1976, Univ. Beograd. Publ. Elektroehn. Fak. Ser. Mat. Fiz., V544, P43
[6]  
Elspas B., 1970, J COMBINATORIAL THEO, V9, P297, DOI 10.1016/S0021-9800(70)80068-0
[7]  
HARARY F, 1974, GRAPH COMBINATOR, P45
[8]  
Hic P., 1998, Math. Slovaca, V48, P429
[9]   Optimal distributed algorithms in unlabeled tori and chordal rings [J].
Mans, B .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1997, 46 (01) :80-90
[10]  
Ramanujan S., 1918, T CAMBRIDGE PHILOS S, V22, P259