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

Enumeration of Cayley graphs and digraphs

โœ Scribed by Brian Alspach; Marni Mishna


Book ID
108315758
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
137 KB
Volume
256
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Isomorphic factorization of the complete
โœ G. L. Chia; Poh-Hwa Ong ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB

## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on

Hamiltonian cycles and paths in Cayley g
โœ Stephen J. Curran; Joseph A. Gallian ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced

Cayley digraphs and lexicographic produc
โœ Xing Peng; Dianjun Wang ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Higher Education Press and Springer ๐ŸŒ English โš– 140 KB
The conjunction of Cayley digraphs
โœ Kevin Keating ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB