Enumeration of 2-regular circulant graphs and directed double networks |
| |
Authors: | Aygul Mamut Liu Fenjin |
| |
Affiliation: | The College of Mathematics and Systems Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China |
| |
Abstract: | We present a formula to enumerate non-isomorphic circulant digraphs of order n with connection sets of cardinality 2. This formula simplifies to C(n,2)=3×2a−1−4 in the case when n=2a(a≥3), and when n=pa(where p is an odd prime and a≥1). The number of non-isomorphic directed double networks are also enumerated. |
| |
Keywords: | Circulant graph Directed double network Enumeration |
本文献已被 ScienceDirect 等数据库收录! |
|