Results 81 to 90 of about 22,931 (240)
Commuting Pairs in Quasigroups
Journal of Combinatorial Designs, Volume 33, Issue 11, Page 418-427, November 2025.ABSTRACT A quasigroup is a pair ( Q , ∗ ), where Q is a nonempty set and ∗ is a binary operation on Q such that for every ( a , b ) ∈ Q 2, there exists a unique ( x , y ) ∈ Q 2 such that a ∗ x = b = y ∗ a. Let ( Q , ∗ ) be a quasigroup. A pair ( x , y ) ∈ Q 2 is a commuting pair of ( Q , ∗ ) if x ∗ y = y ∗ x.
Jack Allsop, Ian M. Wanless
wiley +1 more source
Cayley Picture Fuzzy Graphs and Interconnected Networks [PDF]
, 2022 Waheed Ahmad Khan +2 more
openalex +1 more source
Complete Rotations in Cayley Graphs
European Journal of Combinatorics, 2001 Consider a Cayley graph \(\text{Cay}(G,S)\) of a finite group \(G\) generated by a set \(S=S^{-1}=\{s_0,\ldots,s_{|S|-1}\}\) where \(1\notin S\). A bijection \(\omega:G\to G\) is called a complete rotation of the graph if \(\omega(1)=1\) and \(\omega(xs_i)=\omega(x)s_{i+1}\) for all \(x\in G\) and all \(i\in{\mathbb{Z}}_{|S|}\).
Heydemann, Marie-Claude +2 more
openaire +1 more source
Mean‐field behaviour of the random connection model on hyperbolic space
Journal of the London Mathematical Society, Volume 112, Issue 5, November 2025.Abstract We study the random connection model on hyperbolic space Hd${\mathbb {H}^d}$ in dimension d=2,3$d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity λ>0$\lambda >0$. Upon variation of λ$\lambda$, there is a percolation phase transition: there exists a critical value λc>0$\lambda _c>0$ such that for λ<
Matthew Dickson, Markus Heydenreich
wiley +1 more source
Automorphisms of Cayley graphs on generalised dicyclic groups
, 2013 A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian groups and ...
Morris, Joy +2 more
core
Isomorphisms of generalized Cayley graphs
Ars Mathematica Contemporanea, 2018 Summary: In this paper, we investigate the isomorphism problems of the generalized Cayley graphs, which are generalizations of the traditional Cayley graphs. We find that there are two types of natural isomorphisms for the generalized Cayley graphs. We also study the GCI-groups among the generalized Cayley graphs, and the Cayley regressions of some ...
Feng, Lihua, Liu, Weijun, Yang, Xu
openaire +4 more sources
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
On the Eigenvalue Spectrum of Cayley Graphs: Connections to Group Structure and Expander Properties
MathematicsCayley graphs sit at the intersection of algebra, geometry, and theoretical computer science. Their spectra encode fine structural information about both the underlying group and the graph itself.
Mohamed A. Abd Elgawad +4 more
doaj +1 more source
Preconditioned Deformation Grids
Computer Graphics Forum, Volume 44, Issue 7, October 2025.Abstract Dynamic surface reconstruction of objects from point cloud sequences is a challenging field in computer graphics. Existing approaches either require multiple regularization terms or extensive training data which, however, lead to compromises in reconstruction accuracy as well as over‐smoothing or poor generalization to unseen objects and ...
Julian Kaltheuner +4 more
wiley +1 more source
Quantum Unique Ergodicity for Cayley graphs of quasirandom groups [PDF]
, 2022 Michael Magee, Joe Thomas, Zhao, Yufei
openalex +1 more source