๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Characterization of c-circulant digraphs of degree two which are circulant

โœ Scribed by J.M. Brunat; M. Maureso; M. Mora

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
796 KB
Volume
165-166
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

A c-circulant digraph G,(c, A) has Z,V as its vertex set and adjacency rules given by .X + cs + a with a E A c Z,. The c-circulant digraphs of degree two which are isomorphic to some circulant digraph are characterized, and the corresponding isomorphism is given. Moreover. a sufficient condition is obtained for a c-circulant digraph to be a Cayley digraph.

๐Ÿ“œ SIMILAR VOLUMES

On non-Hamiltonian circulant digraphs of
On non-Hamiltonian circulant digraphs of outdegree three
โœ Locke, Stephen C.; Witte, Dave ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 136 KB

We construct infinitely many connected, circulant digraphs of outdegree three that have no Hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vert

Flows in circulant graphs of odd order a
Flows in circulant graphs of odd order are sums of Hamilton cycles
โœ Stephen C. Locke; Dave Witte ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 889 KB

We show any flow in any connected circulant graph of odd order can be expressed as a sum of Hamilton cycles.