Results 21 to 30 of about 22,931 (240)
On Some Properties of Signed Cayley Graph Sn
We define the signed Cayley graph on Cayley graph Xn denoted by Sn, and study several properties such as balancing, clusterability and sign-compatibility of the signed Cayley graph Sn.
Deepa Sinha +2 more
doaj +1 more source
A Cayley graph Γ\Gamma on a group G is called a dual Cayley graph on G if the left regular representation of G is a subgroup of the automorphism group of Γ\Gamma (note that the right regular representation of G is always an automorphism group of Γ ...
Pan Jiangmin
doaj +1 more source
On Some Properties of Addition Signed Cayley Graph
We define an addition signed Cayley graph on a unitary addition Cayley graph Gn represented by Σn∧, and study several properties such as balancing, clusterability and sign compatibility of the addition signed Cayley graph Σn∧.
Obaidullah Wardak +2 more
doaj +1 more source
A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A119
A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y.
Bo Ling, Wanting Li, Bengong Lou
doaj +1 more source
Orthogonal colourings of Cayley graphs [PDF]
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal colourings of Cayley graphs are discussed.
Jeannette Janssen, Kyle MacKeigan
openaire +3 more sources
Groups all of whose undirected Cayley graphs are integral [PDF]
Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose vertex set is $G$
Abdollahi, Alireza, Jazaeri, Mojtaba
core +1 more source
Testing Cayley graph densities
We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph.
Arzhantseva, Goulnara N. +3 more
openaire +4 more sources
Non-Cayley-Isomorphic Cayley graphs from non-Cayley-Isomorphic Cayley digraphs
10 ...
Morris, Dave Witte, Morris, Joy
openaire +3 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
Locally Testable Codes and Cayley Graphs [PDF]
We give two new characterizations of ($\F_2$-linear) locally testable error-correcting codes in terms of Cayley graphs over $\F_2^h$: \begin{enumerate} \item A locally testable code is equivalent to a Cayley graph over $\F_2^h$ whose set of generators ...
Ben-Sasson Eli +5 more
core +1 more source

