Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

44

EJC
2002

favoriteEmaildiscussreport

105views Information Technology» more EJC 2002»

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

13 years 10 months ago

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

Download www.math.tu-graz.ac.at

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.

Markus Neuhauser

Real-time Traffic

Cayley Graph | EJC 2002 | Information Technology | Neighbourhood Graph | Short Note |

claim paper

Related Content

» Restricted Walks in Regular Trees

» Cayley DHTs A GroupTheoretic Framework for Analyzing DHTs Based on Cayley Graphs

» Graphical and Computational Representation of Groups

» Hard Metrics from Cayley Graphs of Abelian Groups

» Balanced Cayley graphs and balanced planar graphs

» Vertex reconstruction in Cayley graphs

» Automorphism groups with cyclic commutator subgroup and Hamilton cycles

» Toidas Conjecture is True

» The Connectivity of addition Cayley graphs

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	EJC
Authors	Markus Neuhauser

Comments (0)