Please use this identifier to cite or link to this item:
|Title:||On 2-extendable abelian Cayley graphs|
|Citation:||Chan, O.,Chen, C.C.,Yu, Q. (1995-11-15). On 2-extendable abelian Cayley graphs. Discrete Mathematics 146 (1-3) : 19-32. ScholarBank@NUS Repository.|
|Abstract:||A graph G is 2-extendable if any two independent edges of G are contained in a perfect matching of G. A Cayley graph of even order over an abelian group is 2-extendable if and only if it is not isomorphic to any of the following circulant graphs: 1. (I) Z2n(1, 2n - 1), n ≥ 3; 2. (II) Z2n(1, 2, 2n - 1, 2n - 2), n ≥ 3; 3. (III) Z4n(1, 4n - 1, 2n), n ≥ 2; 4. (IV) Z4n + 2(2,4n,2n + 1), n ≥ 1; and 5. (V) Z4n +2(1,4n + 1, 2n, 2n + 2), n ≥ 1. © 1995.|
|Source Title:||Discrete Mathematics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.