Results 51 to 60 of about 589,042 (217)
Journal of Symbolic ComputationGiven positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism group. We use these methods to generate complete lists of pairwise nonisomorphic 3-valent Cayley graphs with at ...
Rhys J. Evans, Primož Potočnik
openaire +5 more sources
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
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
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
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
Electronic Notes in Discrete Mathematics, 2000 Abstract In this paper we investigate the class of Cayley partitionable graphs. This investigation is motivated by the Strong Perfect Graph Conjecture. Cayley partitionable graphs are Cayley Graphs which are closely related to near-factorizations of finite groups. We prove some structural properties of near-factorizations and give examples of Cayley
openaire +1 more source
On Finite Subnormal Cayley Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 In this paper we introduce and study a type of Cayley graph – subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph $\mathbf{K}_{p^d,p^d}$ with $p$ prime.
openaire +3 more sources
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +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