Results 51 to 60 of about 994,076 (215)
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
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.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
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
Fractality of wave functions on a Cayley tree: Difference between tree and locally treelike graph without boundary [PDF]
, 2016 We investigate analytically and numerically eigenfunction statistics in a disordered system on a finite Bethe lattice (Cayley tree). We show that the wave-function amplitude at the root of a tree is distributed fractally in a large part of the ...
Konstantin S. Tikhonov +3 more
semanticscholar +1 more source
Approximating Cayley Diagrams Versus Cayley Graphs [PDF]
Combinatorics, Probability and Computing, 2012 We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a Hamiltonian cycle in one of them has a limit that is not approximable by ...
openaire +2 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
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
Journal of Combinatorial Theory, Series B, 1986 An example is given of a finite group A of order 144, with a generating set \(X=\{x,y\}\) such that \(x^ 3=y^ 2=1\) and such that the Cayley graph C(A,X) has genus 4 and characteristic -6 (both of which are small relative to the order of A), although there is no short relator of the form \((xy)^ r\) with ...
openaire +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
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