✦ LIBER ✦

On 1-factorizability of Cayley graphs

✍ Scribed by Richard A Stong

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 757 KB
Volume: 39
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90056-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Channel assignment on Cayley graphs

✍ Patrick Bahls 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if G is the Cayley graph of an n-generated group with a certain kind of presentation, then (G; k, 1) ≤ 2(k +n-1). F

A note on Cayley graphs

✍ Marston Conder 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Some problems on Cayley graphs

✍ Elena Konstantinova 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 189 KB

On Isomorphisms of Finite Cayley Graphs

✍ M. Conder; C. Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼ = Cay(G, T ), there exists an automorphism σ of G such that S σ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a

On the connectivity of cayley graphs

✍ Wilfried Imrich 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 282 KB

On Normal Cayley Graphs and Hom-idempote

On Normal Cayley Graphs and Hom-idempotent Graphs

✍ Benoit Larose; François Laviolette; Claude Tardif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A graph G is said to be hom-idempotent if there is a homomorphism from G 2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from G n+1 to G n . We characterize both classes of graphs in terms of a special class of Cayley graphs called normal Cayley graphs. This allows us to