๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

โœ Scribed by Markus Neuhauser

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
134 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this short note the neighbourhood graph of a Cayley graph is considered. It has, as nodes, a symmetric generating set of a finitely-generated group . Two nodes are connected by an edge if one is obtained from the other by multiplication on the right by one of the generators. Two necessary conditions on the graphs are shown. One is a condition on the degrees of the graph, the other concerns complete subgraphs.

๐Ÿ“œ SIMILAR VOLUMES

On Isomorphisms of Finite Cayley Graphs
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

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.

Random Subgraphs of Cayley Graphs overp-
Random Subgraphs of Cayley Graphs overp-Groups
โœ C.M. Reidys ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 146 KB

The subject of this paper is the size of the largest component in random subgraphs of Cayley graphs, X n , taken over a class of p-groups, G n . G n consists of p-groups, G n , with the following properties: , where K is some positive constant. We consider Cayley graphs X n = (G n , S n ), where S

Routing in a Class of Cayley Graphs of S
Routing in a Class of Cayley Graphs of Semidirect Products of Finite Groups
โœ Fen Lin Wu; S. Lakshmivarahan; S.K. Dhall ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 374 KB

Recently, Draper initiated the study of interconnection networks based on Cayley graphs of semidirect products of two cyclic groups called supertoroids. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. The Borel graphs introduced by

Partition graphs for finite symmetric gr
Partition graphs for finite symmetric groups
โœ Conder, Marston; Morton, Margaret; Praeger, Cheryl E. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 130 KB ๐Ÿ‘ 2 views

This paper outlines an investigation of a class of arc-transitive graphs admitting a f inite symmetric group S n acting primitively on vertices, with vertex-stabilizer isomorphic to the wreath product S m wr S r (preserving a partition of {1, 2, . . . , n} into r parts of equal size m). Several prop