Related papers: From cycles to circles in Cayley graphs
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
We study the extension of homologically trivial symplectic or Hamiltonian cyclic actions to Hamiltonian circle actions on irrational ruled symplectic $4$-manifolds. On one hand, we construct symplectic involutions on minimal irrational…
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…
Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent…
A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…
The end compactification |\Gamma| of the locally finite graph \Gamma is the union of the graph and its ends, endowed with a suitable topology. We show that \pi_1(|\Gamma|) embeds into a nonstandard free group with hyperfinitely many…
In this paper, we investigate the existence of quantum fractional revival in unitary Cayley graphs over finite commutative rings with identity. We characterize all finite local rings that permit quantum fractional revival in their unitary…
We discuss the existence of Hamilton cycles in the random graph $G_{n,p}$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order and (iii) there is a bound on the number of…
Suppose G is a finite group, such that |G| = 16p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…
For bi-Lipschitz homeomorphisms of a compact manifold it is known that topological entropy is always finite. For compact manifolds of dimension two or greater, we show that in the closure of the space of bi-Lipschitz homeomorphisms, with…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
It is shown that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition, including infinitely many Cayley graphs of valency 6, and including Cayley graphs of arbitrarily large valency.
A problem by Diestel is to extend algebraic flow theory of finite graphs to infinite graphs with ends. In order to pursue this problem, we define an A-flow and non-elusive H-flow for arbitrary graphs and for abelian topological Hausdorff…
A characterization is given of finite groups $H$ that have skew-morphisms of order coprime to the order $|H|$, and their skew-morphisms. A complete classification is then given of the automorphism groups and the underlying graphs of…
Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…
We prove that when Hodge theory survives on non-compact symplectic manifolds, a compact symplectic Lie group action having fixed points is necessarily Hamiltonian, provided the associated almost complex structure preserves the space of…
We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…
A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around…