✦ LIBER ✦

Trivalent Cayley graphs for interconnection networks

✍ Scribed by Premkumar Vadapalli; Pradip K. Srimani

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 625 KB
Volume: 54
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00068-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest routing in trivalent Cayley gra

Shortest routing in trivalent Cayley graph network

✍ Premkumar Vadapalli; Pradip K. Srimani 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Exceptional trivalent cayley graphs for

Exceptional trivalent cayley graphs for dihedral groups

✍ David L. Powers 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

## Abstract If __n__ is divisible by at least three distinct primes, the dihedral group __D~n~__ can be generated by three nonredundant, involuntary elements. We study the Cayley graphs resulting from such a presentation of __D~n~__ for several families of __n__ and for all admissible __n__ < 120.

Hamilton cycles in Trivalent Cayley grap

Hamilton cycles in Trivalent Cayley graphs

✍ Meghanad D. Wagh; Jiancheng Mo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 455 KB

It is shown that the Trivalent Cayley graphs, TC,,, are near recursive. In particular, TC, is a union of four copies of i"Cn\_2 with additional well placed nodes. This allows one to recursively build the Hamilton cycle in TC,.

A new 3D representation of trivalent Cay

A new 3D representation of trivalent Cayley networks

✍ Tiziana Calamoneri; Rossella Petreschi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 453 KB

In this paper we deal with trivalent Cayley interconnection networks and we introduce a new representation of them emphasizing their geometric characteristics. Looking inside this model, a new shortest routing algorithm is derived. @ 1997 Elsevier Science B.V.

Matching preclusion and conditional matc

Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars

✍ Eddie Cheng; Philip Hu; Roger Jia; László Lipták 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

Strategies for interconnection networks:

Strategies for interconnection networks: Some methods from graph theory

✍ J.-C. Bermond; C. Delorme; J.-J. Quisquater 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 909 KB

Interconnection networks require dense graphs in the sense that many nodes with relatively few links may be connected with relatively short paths. Some recent constructions of such dense graphs with a given maximal degree A and diameter D (known as (A, D) graphs) are reviewed here. The paper also co