Results 21 to 30 of about 420,658 (213)
Strong Edge Coloring of Cayley Graphs and Some Product Graphs
, 2022 A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index.
Tuza, Zsolt +3 more
core +1 more source
Cayley automaton semigroups [PDF]
, 2015 Let S be a semigroup, C(S) the automaton constructed from the right Cayley graph of S with respect to all of S as the generating set and ∑(C(S)) the automaton semigroup constructed from C(S). Such semigroups are termed Cayley automaton semigroups. For
McLeman, Alexander Lewis Andrew
core +2 more sources
Classification of Cayley Rose Window Graphs
Theory 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
Quantum simulation of Cayley-tree Ising Hamiltonians with three-dimensional Rydberg atoms
Physical 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
Algebra and Logic, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guo, W. +3 more
openaire +2 more sources
Colorings of some Cayley graphs [PDF]
, 2023 Cayley graphs are graphs on algebraic structures, typically groups or group-like structures. In this paper, we have obtained a few results on Cayley graphs on Cyclic groups, powers of cycles, Cayley graphs on some non-abelian groups, and vertex, edge and
S, Prajnanaswaroopa
core +1 more source
A note on $1$-factorizability of quartic supersolvable Cayley graphs [PDF]
Transactions 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]
European 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 +4 more sources
Spectra of twists of Cayley and Cayley sum graphs
Advances 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
, 2023 A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regular ...
Jazaeri, Mojtaba
core +1 more source