نتایج جستجو برای: cayley graphs

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

Journal: :Journal of Combinatorial Theory, Series B 1979

Journal: :Ars Mathematica Contemporanea 2015

Journal: :Electr. J. Comb. 2009
Jin-Xin Zhou

A Cayley graph Cay(G,S) on a group G is said to be normal if the right regular representation R(G) of G is normal in the full automorphism group of Cay(G,S). In this paper, all connected tetravalent non-normal Cayley graphs of order 4p are constructed explicitly for each prime p. As a result, there are fifteen sporadic and eleven infinite families of tetravalent non-normal Cayley graphs of orde...

Journal: :Electr. J. Comb. 2009
A. Abdollahi E. Vatandoost

Let G be a non-trivial group, S ⊆ G \ {1} and S = S−1 := {s−1 | s ∈ S}. The Cayley graph of G denoted by Γ(S : G) is a graph with vertex set G and two vertices a and b are adjacent if ab−1 ∈ S. A graph is called integral, if its adjacency eigenvalues are integers. In this paper we determine all connected cubic integral Cayley graphs. We also introduce some infinite families of connected integra...

Journal: :Electr. J. Comb. 2016
Jin-Xin Zhou Yan-Quan Feng

A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, we give a characterization of cubic nonCayley vertex-transitive bi-Cayley graphs over a regular p-group, where p > 5 is a prime. As an application, a classification of cubic non-Cayley vertex-transitive graphs of order 2p3 is given for each prime p.

Journal: :SIAM J. Discrete Math. 1993
K. Wendy Tang Bruce W. Arden

There is a continuing search for dense (6, D) interconnection graphs, that is, regular, bidirectional, degree 6 graphs with diameter D and having a large number of nodes. Cayley graphs formed by the Borel subgroup currently contribute to some of the densest (6 = 4, D) graphs for a range of D [l]. However, the group theoretic representation of these graphs makes the development of ef i cient rou...

1993
Emanuel Knill

Hamidoune’s connectivity results [11] for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayley coset digraph can be hierarchically decomposed in a certain way, then it is optimally vertex connected. The results are obtained by extending the methods used in [11]. They are used to show that cycle-prefix g...

For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.

Journal: :international journal of group theory 2014
ali reza ashrafi bijan soleimani

darafsheh and assari in [normal edge-transitive cayley graphs onnon-abelian groups of order 4p, where p is a prime number, sci. china math. {bf 56} (1) (2013) 213$-$219.] classified the connected normal edge transitive and $frac{1}{2}-$arc-transitive cayley graph of groups of order$4p$. in this paper we continue this work by classifying theconnected cayley graph of groups of order $2pq$, $p > q...

Journal: :Ars Comb. 2006
Zaiping Lu Changqun Wang Mingyao Xu

For a group T and a subset S of T , the bi-Cayley graph BCay(T, S) of T with respect to S is the bipartite graph with vertex set T×{0, 1} and edge set {{(g, 0), (sg, 1)} | g ∈ T, s ∈ S}. In this paper, we investigate cubic bi-Cayley graphs of finite nonabelian simple groups. We give several sufficient or necessary conditions for a bi-Cayley graph to be semisymmetric, and construct several infin...

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

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