✦ LIBER ✦

Broadcasting on recursively decomposable Cayley graphs

✍ Scribed by Chandra GowriSankaran

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 789 KB
Volume: 53
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90183-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-to-all broadcast algorithm for const

One-to-all broadcast algorithm for constant degree 4 Cayley graphs

✍ Mohamed Benmaiza; Abderezak Touzene 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Broadcasting in interconnection networks is crucial because of its multiple utilization in linear algebra problems, neural networks, optimization problems and other ®elds alike. Many global communication algorithms have been studied for dierent topologies of interconnection networks such as hypercub

On quasi-Cayley graphs

✍ Ginette Gauyacq 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 925 KB

WC introduce the concept of quasi-Cayley graphs, a class of vertex-transitive graphs which contains Cayley graphs, and study some of their properties. By finding vertex-transitive graphs which are not quasi-Cayley graphs we give a negative answer to a question by Fuller and Krishnamurthy on the quas

On Perfect Cayley Graphs

✍ Agnes V. Dizon-Garciano; Ian June L. Garces; Mari-Jo P. Ruiz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 460 KB

On broadcasting in unicyclic graphs

✍ Hovhannes A. Harutyunyan; Edward Maraachlian 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 385 KB

Broadcasting on Incomplete WK-Recursive

Broadcasting on Incomplete WK-Recursive Networks

✍ Ming-Yang Su; Gen-Huey Chen; Dyi-Rong Duh 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 425 KB

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