نتایج جستجو برای: integral cayley graph

تعداد نتایج: 312504  

Journal: :CoRR 2017
Roman Nedela Ilia Ponomarenko

We construct a polynomial-time algorithm that given a graph X with 4p vertices (p is prime), finds (if any) a Cayley representation of X over the group C2 × C2 × Cp. This result, together with the known similar result for circulant graphs, shows that recognising and testing isomorphism of Cayley graphs over an abelian group of order 4p can be done in polynomial time.

2007
Cornelia Drutu Michael Kapovich

Preface The main goal of this book is to describe several tools of the quasi-isometric rigidity and to illustrate them by presenting (essentially self-contained) proofs of several fundamental theorems in this area: Gromov's theorem on groups of polynomial growth, Mostow Rigidity Theorem and Schwartz's quasi-isometric rigidity theorem for nonuniform lattices in the real-hyperbolic spaces. We con...

2011
Anil Kumar

In this paper we introduce a new class of double coset Cayley digraphs induced by loops. These graphs can be considered as the generalization of Double coset Cayley digraphs induced by groups . Moreover, various graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature. Mathematics Subject Classification: 05C25

2009
Kolja Knauer Ulrich Knauer

In this note we study embeddings of Cayley graphs of right groups on surfaces. We characterize those right groups which have a toroidal but no planar Cayley graph, such that the generating system of the right group has a minimal generating system of the group as a factor.

2008
Jan M. Swart

We consider contact processes on general Cayley graphs. It is shown that any such contact process has a well-defined exponential growth rate, which can be related to the configuration seen from a ‘typical’ infected site at a ‘typical’ late time. Using this quantity, it is proved that on any nonamenable Cayley graph, the critical contact process dies out.

1996
Dominique Désérable

The \arrowhead torus" is a broadcast graph that we deene on the 6-valent grid as a Cayley graph. We borrow the term from Mandelbrot who qualiies in that way one of the Sierpinski's famous fractal constructions. The 6-valent grid H = (V; E) is generated by three families of straight lines. We adopt the isotropic orientation S ! N, NE ! SW, NW ! SE and deene the system of generators S = fs 1 ; s ...

2003
CHERYL E. PRAEGER

For a positive integer n, does there exist a vertex-transitive graph r on n vertices which is not a Cayley graph, or, equivalently, a graph r on n vertices such that Aut F is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, MaruSic and Scapellato, and McKay and the second author) has produced answers to ...

2014
Edinah K. Gnang

We present a formulation of the Cayley-Hamilton theorem for hypermatrices in conjunction with the corresponding combinatorial interpretation. Finally we discuss how the formulation of the Cayley-Hamilton theorem for hyermatrices leads to new graph invariants which in some cases results in symmetry breakings among cospectral graphs.

2012
Anil Kumar

In this paper we introduce a new class of double coset Cayley digraphs induced by quasigroups. These graphs can be considered as the generalization of Double Coset Cayley Digraphs induced by loops. Moreover, various graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature.

2010
Brian Alspach C. C. Chen Matthew Dean

We investigate the existence of Hamilton paths in connected Cayley graphs on generalized dihedral groups. In particular, we show that a connected Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamiltonconnected, unless it is bipartite, in which case it is Hamilton-laceable.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید