Results 41 to 50 of about 22,931 (240)
Mixed Moore Cayley Graphs [PDF]
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected edges and directed arcs in the graph.
openaire +2 more sources
Constructing Independent Spanning Trees on Pancake Networks
For any graph G, the set of independent spanning trees (ISTs) is defined as the set of spanning trees in G. All ISTs have the same root, paths from the root to another vertex between distinct trees are vertex-disjoint and edge-disjoint.
Dun-Wei Cheng +2 more
doaj +1 more source
The The Cayley Graph of Semi-Direct Product of finite Groups: Interrelationships and Construction
In this paper, we study Cayley graph of the semi-direct product of two finite groups where is an odd prime numbe. Specifically, we endeavor to establish a comprehensive understanding of the Cayley graph by investigating the interrelationships among ...
Hayder Baqer Shelash, Ali Adel Shaker
doaj +1 more source
Labelled tree graphs, Feynman diagrams and disk integrals
In this note, we introduce and study a new class of “half integrands” in Cachazo-He-Yuan (CHY) formula, which naturally generalize the so-called Parke-Taylor factors; these are dubbed Cayley functions as each of them corresponds to a labelled tree graph.
Xiangrui Gao, Song He, Yong Zhang
doaj +1 more source
Distance-regular Cayley graphs with small valency
We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection ...
Jazaeri, Mojtaba, van Dam, Edwin R.
core +1 more source
A classification of finite groups with integral bi-Cayley graphs [PDF]
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
On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian [PDF]
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
Dimer models and conformal structures
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Symmetry 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
Quantum simulation of Cayley-tree Ising Hamiltonians with three-dimensional Rydberg atoms
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

