Results 21 to 30 of about 18,175 (189)

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

Orthogonal colourings of Cayley graphs [PDF]

open access: yesDiscrete Mathematics, 2020
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

Locally Testable Codes and Cayley Graphs [PDF]

open access: yes, 2013
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

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

Brief survey on divisor graphs and divisor function graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
Number theoretic graphs are one of the emerging fields in Graph theory. This article is a study on existing research results on Number theoretic graphs, especially on Divisor Graphs [Formula: see text], Divisor Function Graphs (DFGs) and Divisor Cayley ...
Vignesh Ravi, Kalyani Desikan
doaj   +1 more source

Testing Cayley graph densities

open access: yesAnnales mathématiques Blaise Pascal, 2008
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

On finite dual Cayley graphs

open access: yesOpen Mathematics, 2020
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

Cayley and Tutte polytopes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs.
Matjaž Konvalinka, Igor Pak
doaj   +1 more source

Home - About - Disclaimer - Privacy