✦ LIBER ✦

Channel assignment on Cayley graphs

✍ Scribed by Patrick Bahls

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 100 KB
Volume: 67
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20523

No coin nor oath required. For personal study only.

✦ Synopsis

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). For certain values of k this bound gives the obvious optimal value for any 2n-regular graph. A large number of groups (for instance, even Artin groups and a number of Baumslag-Solitar groups) satisfy this condition.

📜 SIMILAR VOLUMES

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

Graph labeling and radio channel assignm

Graph labeling and radio channel assignment

✍ van den Heuvel, J.; Leese, R. A.; Shepherd, M. A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 438 KB

The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels. As a model for the way in which interference is avoided in real radio systems, e

Isomorphic Cayley graphs on nonisomorphi

Isomorphic Cayley graphs on nonisomorphic groups

✍ Morris, Joy 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB

The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended.

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 cubic non-Cayley vertex-transitive gr

On cubic non-Cayley vertex-transitive graphs

✍ Klavdija Kutnar,; Dragan Marušič;; Cui Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract In 1983, the second author [D. Marušič, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers __n__ there exists a non‐Cayley vertex‐transitive graph on __n__ vertices. (The term __non‐Cayley numbers__ has later been given to such integers.) Motivated by this problem,

On Isomorphisms of Connected Cayley Grap

On Isomorphisms of Connected Cayley Graphs, II

✍ Cai Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A Cayley graph or digraph Cay(G, S) of a finite group G is called a CI-graph of G if, for any T/G, Cay(G, S)$Cay(G, T) if and only if S \_ =T for some \_ # Aut(G). We study the problem of determining which Cayley graphs and digraphs for a given group are CI-graphs. A finite group G is called a conne