Results 31 to 40 of about 18,175 (189)
Transitive permutation groups of prime-squared degree [PDF]
We explicitly determine all of the transitive groups of degree p-squared, p a prime, whose Sylow p-subgroup is not the wreath product of two cyclic groups of order p.
Dobson, Edward, Witte, Dave
core +2 more sources
Improved Expansion of Random Cayley Graphs [PDF]
In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is a finite c(ε) such that for any sufficiently large group G, the expected value of the second largest (in absolute value) eigenvalue of the ...
Po-Shen Loh, Leonard J. Schulman
doaj +2 more sources
On the distance eigenvalues of Cayley graphs
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Cayley graphs of basic algebraic structures [PDF]
We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancellative monoids, and groups.
Didier Caucal
doaj +1 more source
Integral Cayley Sum Graphs and Groups
For any positive integer k, let Ak denote the set of finite abelian groups G such that for any subgroup H of G all Cayley sum graphs CayS(H, S) are integral if |S| = k. A finite abelian group G is called Cayley sum integral if for any subgroup H of G all
Ma Xuanlong, Wang Kaishun
doaj +1 more source
Quartic integral Cayley graphs
We give exhaustive lists of connected 4-regular integral Cayley graphs and connected 4-regular integral arc-transitive graphs. An integral graph is a graph for which all eigenvalues are integers. A Cayley graph Cay(Γ, S) for a given group Γ and connection set S ⊂ Γ is the graph with vertex set Γ and with a connected to b if and only if ba−1 ∈ S.
Minchenko, Marsha, Wanless, Ian M.
openaire +3 more sources
COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q [PDF]
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of ...
M. Ghorbani +2 more
doaj +1 more source
Distance-regular Cayley graphs with small valency
We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection ...
Jazaeri, Mojtaba, van Dam, Edwin R.
core +1 more source
Uniquely colorable Cayley graphs
It is shown that the chromatic number χ ( G ) = k of a uniquely colorable Cayley graph G over a group Γ is a divisor of ∣Γ ∣ = n . Each color class in a k -coloring of G is a coset of a subgroup of order n / k of Γ . Moreover, it is proved that ( k − 1) n is a sharp lower bound for the number of edges of a uniquely k
Klotz, Walter, Sander, Torsten
openaire +3 more sources
Domination Parameters of the Unitary Cayley Graph of /n
The unitary Cayley graph of /n, denoted Xn, is the graph with vertex set {0, . . ., n − 1} where vertices a and b are adjacent if and only if gcd(a − b, n) = 1.
Burcroff Amanda
doaj +1 more source

