Results 71 to 80 of about 452 (178)

Complete Rotations in Cayley Graphs

open access: yesEuropean 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

open access: yesJournal 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

Isomorphisms of generalized Cayley graphs

open access: yesArs 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

open access: yesJournal 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

Barycentric Subdivision of Cayley Graphs With Constant Edge Metric Dimension

open access: yesIEEE Access, 2020
A motion of a robot in space is represented by a graph. A robot change its position from point to point and its position can be determined itself by distinct labelled landmarks points.
Ali N. A. Koam, Ali Ahmad
doaj   +1 more source

Preconditioned Deformation Grids

open access: yesComputer 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

Absorption cayley graph

open access: yesElectronic Notes in Discrete Mathematics, 2016
Abstract Let R be a commutative ring with two binary operators addition (+) and multiplication (.). Then Z n is a ring of integers modulo n, where n is a positive integer. A Absorption Cayley graph denoted by Ω ( Z n ) is a graph whose vertex set is Z n , the integer modulo n and edge set E = { a b ...
null Deepa Sinha, null Deepakshi Sharma
openaire   +1 more source

Analysis of four Apollo 16 double drive tubes using QEMSCAN® mapping techniques: Implications for sampling the lunar regolith in highland terrains

open access: yesMeteoritics &Planetary Science, Volume 60, Issue 10, Page 2504-2523, October 2025.
Abstract The lunar regolith contains a rich history of Solar System impact events and solar activity. Many future missions will land in the south polar region of the Moon, a heavily impact cratered highland terrain, similar to the Apollo 16 landing site.
Stephanie L. Halwa   +3 more
wiley   +1 more source

ON (3,6) AND (4,6) - FULLERENE CAYLEY GRAPHS

open access: yesStudia Universitatis Babes-Bolyai Chemia, 2016
An (r, s)-fullerene graph is a planar 3-regular graph with only Cr and Cs faces, where Cn denotes a cycle of length n. In this paper, the (3,6)-fullerene Cayley graphs constructed from finite groups are classified.
Ali Reza ASHRAFI   +2 more
doaj  

Home - About - Disclaimer - Privacy