Results 41 to 50 of about 20,494 (188)
The The Cayley Graph of Semi-Direct Product of finite Groups: Interrelationships and Construction
Journal of Kufa for Mathematics and ComputerIn this paper, we study Cayley graph of the semi-direct product of two finite groups where is an odd prime numbe. Specifically, we endeavor to establish a comprehensive understanding of the Cayley graph by investigating the interrelationships among ...
Hayder Baqer Shelash, Ali Adel Shaker
doaj +1 more source
Homomorphisms of binary Cayley graphs
, 2015 A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic number 3.
Beaudou, Laurent +2 more
core +3 more sources
Distance-regular Cayley graphs with small valency
, 2019 We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection ...
Jazaeri, Mojtaba, van Dam, Edwin R.
core +1 more source
A classification of finite groups with integral bi-Cayley graphs [PDF]
Transactions on Combinatorics, 2015 The bi-Cayley graph of a finite group G with respect to a subset S⊆G , which is denoted by \BCay(G,S) , is the graph with vertex set G×{1,2} and edge set {{(x,1),(sx,2)}∣x∈G, s∈S} . A finite group G is called a \textit{bi-Cayley integral
Majid Arezoomand , Bijan Taeri
doaj
On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian [PDF]
Mathematics Interdisciplinary Research, 2018 In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
Majid Arezoomand
doaj +1 more source
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Journal of MathematicsSymmetry properties are of vital importance for graphs. The famous Cayley graph is a good mathematical model as its high symmetry. The normality of the graph can well reflect the symmetry of the graph.
Li Wang, Xiaohan Ye, Weihua Yang
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
Sensitivity and Hamming Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For any m ≥ 3 $m\ge 3$ we show that the Hamming graph H ( n , m ) $H(n,m)$ admits an imbalanced partition into m $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m $m$‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio +3 more
wiley +1 more source
Discrete Mathematics, 1992 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 +3 more sources