Results 11 to 20 of about 420,658 (213)
Moore mixed graphs from Cayley graphs [PDF]
A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs. When the order of G is close to M(
Cristina Dalfo, Miquel Àngel Fiol
doaj +2 more sources
We introduce the concept of Cayley bipolar fuzzy graphs and investigate some of their properties. We present some interesting properties of bipolar fuzzy graphs in terms of algebraic structures.
Noura O. Alshehri, Muhammad Akram
doaj +2 more sources
Token graphs of Cayley graphs as lifts [PDF]
This paper describes a general method for representing $k$-token graphs of Cayley graphs as lifts of voltage graphs. This allows us to construct line graphs of circulant graphs and Johnson graphs as lift graphs on cyclic groups. As an application of the method, we derive the spectra of the considered token graphs.
Cristina Dalfó +3 more
core +8 more sources
Given a quasigroup \(Q\) with a right identity element and a right-associative generating subset \(S\), a quasi-Cayley graph \(\text{QC}(Q,S)\) is constructed in very much the same way as a Cayley graph is constructed from a given group and a symmetric generating set.
Ginette Gauyacq, Gauyacq, Ginette
openaire +3 more sources
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 +2 more sources
Given positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism group. We use these methods to generate complete lists of pairwise nonisomorphic 3-valent Cayley graphs with at ...
Rhys J. Evans, Primož Potočnik
openaire +6 more sources
Generalized Cayley graphs [PDF]
The autors introduce the concept of generalized Cayley graph. The main result is that if \(X\) is a graph, \(B(X)\) its double covering then \(B(X)\) is a Cayley graph if and only if \(X\) is a generalized Cayley graph. Another result is that a generalized Cayley graph that is stable is a Cayley graph. Furthermore a construction is given of a family of
MARUSIC D. +2 more
openaire +4 more sources
Abstract A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a chordless cycle whose length is odd and ...
Agnes V. Dizon-Garciano +2 more
openaire +2 more sources
On the Cayley graphs of symmetric group $S_4$ [PDF]
Let $S_n$ be the symmetric group of degree $n$. In this paper, we classify non-isomorphic Cayley graphs of $S_4$ of valency 3. Moreover, we verify that there are exactly 10 non-isomorphic Cayley graphs of $S_4$ with valency 3.
Fatemeh Raei
doaj +1 more source

