𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing Homogeneous Factorisations of Complete Graphs and Digraphs

✍ Scribed by Cai Heng Li; Cheryl E. Praeger

Book ID
106048151
Publisher
Springer Japan
Year
2002
Tongue
English
Weight
93 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Homogeneous factorisations of graph prod
Homogeneous factorisations of graph products
✍ Michael Giudici; Cai Heng Li; PrimoΕΎ Potočnik; Cheryl E. Praeger πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 257 KB
A Family of Perfect Factorisations of Co
A Family of Perfect Factorisations of Complete Bipartite Graphs
✍ Darryn Bryant; Barbara M. Maenhaut; Ian M. Wanless πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 493 KB

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n=p 2 for an odd prime p. We construct a family of ( p -1)/2 non-isomorphic perfect 1-factorisations of K n, n . Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin s

Algorithms for constructing graphs and d
Algorithms for constructing graphs and digraphs with given valences and factors
✍ D.J. Kleitman; D.L. Wang πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 942 KB

Given a set of valences ( ui) such that { ui> and (vi-k} are both realizable as valences of graphs without loops or multiple edges, an explicit conslruction method is described for obtaining a graph with valences {ui] having a k-factor. A number of extensions of the result are obtained. Similar resu

On constructing snakes in powers of comp
On constructing snakes in powers of complete graphs
✍ Jerzy Wojciechowski πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 737 KB

We prove the conjecture of Abbott and Katchalski that for every m ~> 2 there is a positive constant 2,. such that S(K~n ) >~ 2mnd-lS(Ka~ -1) where S(Ka~) is the length of the longest snake (cycle without chords) in the cartesian product K~ of d copies of the complete graph Kin. As a corollary, we co

Isomorphic factorization of the complete
Isomorphic factorization of the complete graph into Cayley digraphs
✍ 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