Results 11 to 20 of about 472 (183)

Novel Concepts in Rough Cayley Fuzzy Graphs with Applications

open access: yesJournal of Mathematics, 2023
Today, fuzzy graphs (FGs) have a variety of applications in other fields of study, including medicine, engineering, and psychology, and for this reason, many researchers around the world are trying to identify their properties and use them in computer ...
Yongsheng Rao   +5 more
doaj   +1 more source

Applications of Strongly Regular Cayley Graphs to Codebooks

open access: yesIEEE Access, 2023
In this paper, we give a construction of strongly regular Cayley graphs on the finite field $\mathbb {F}_{q^{n}}$ . As applications of these strongly regular Cayley graphs, a class of codebooks is presented and proved to be asymptotically optimal with ...
Qiuyan Wang   +3 more
doaj   +1 more source

On the Cayley graphs of symmetric group $S_4$ [PDF]

open access: yesJournal of Mahani Mathematical Research
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

Classification of Cayley Rose Window Graphs

open access: yesTheory and Applications of Graphs, 2021
Rose window graphs are a family of tetravalent graphs, introduced by Steve Wilson. Following it, Kovacs, Kutnar and Marusic classified the edge-transitive rose window graphs and Dobson, Kovacs and Miklavic characterized the vertex transitive rose window ...
Angsuman Das, Arnab Mandal
doaj   +1 more source

Moore mixed graphs from Cayley graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2023
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   +1 more source

Quantum simulation of Cayley-tree Ising Hamiltonians with three-dimensional Rydberg atoms

open access: yesPhysical Review Research, 2021
Significant efforts are being directed toward developing a quantum simulator capable of solving combinatorial optimization problems. The challenges are Hamiltonian programming in terms of high-dimensional qubit connectivities and large-scale ...
Yunheung Song   +4 more
doaj   +1 more source

A note on $1$-factorizability of quartic supersolvable Cayley graphs [PDF]

open access: yesTransactions on Combinatorics, 2018
Alspach et al‎. ‎conjectured that every quartic Cayley graph on an even solvable group is $1$-factorizable‎. ‎In this paper‎, ‎we verify this conjecture for quartic Cayley graphs on supersolvable groups of even order‎.
Milad Ahanjideh, Ali Iranmanesh
doaj   +1 more source

On covers of graphs by Cayley graphs [PDF]

open access: yesEuropean Journal of Combinatorics, 2017
We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented Cayley graphs, as well as further related questions.
openaire   +3 more sources

Spectra of twists of Cayley and Cayley sum graphs

open access: yesAdvances in Applied Mathematics, 2022
Let $G$ be a finite group with $|G|\geq 4$ and $S$ be a subset of $G$. Given an automorphism $σ$ of $G$, the twisted Cayley graph $C(G, S)^σ$ (resp. the twisted Cayley sum graph $C_Σ(G, S)^σ$) is defined as the graph having $G$ as its set of vertices and the adjacent vertices of a vertex $g\in G$ are of the form $σ(gs)$ (resp.
Arindam Biswas 0003, Jyoti Prakash Saha
openaire   +2 more sources

Domination in Cayley graphs: A survey

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
Let Ω be a symmetric generating set of a finite group Γ. Assume that (Γ,Ω)be such that Γ=〈Ω〉and Ω satisfies the two conditions C1: the identity element e∉Ω and C2: if a∈Ω, then a−1∈Ω. Given (Γ,Ω)satisfying C1and C2, define a Cayley graph G=Cay(Γ,Ω)with V(
T. Tamizh Chelvam, M. Sivagami
doaj   +2 more sources

Home - About - Disclaimer - Privacy