Results 41 to 50 of about 589,042 (217)
A note on the k-degree Cayley graph [PDF]
, 2008 The k-degree Cayley graph has been proposed by Hsieh and Hsiao (Networks 47 (2006), 26-36). They have shown that the k-degree Cayley graph is actually a Cayley graph.
Tanaka, Yuuki +3 more
core +1 more source
Testing Cayley graph densities [PDF]
, 2006 We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper
Guba, Víctor S. +4 more
core +1 more source
The unitary Cayley graph of a semiring [PDF]
, 2023 We study the unitary Cayley graph of a matrix semiring. We find bounds for its diameter, clique number and independence number, and determine its girth. We also find the relationship between the diameter and the clique number of a unitary Cayley graph of
Dolžan, David
core +1 more source
The The Cayley Graph of Semi-Direct Product of finite Groups: Interrelationships and Construction
Journal of Kufa for Mathematics and ComputerIn 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
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Discussiones Mathematicae Graph Theory, 2016 Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note,
Ganesan Ashwin
doaj +1 more source
Constructing Independent Spanning Trees on Pancake Networks
IEEE Access, 2020 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
On the connectivity of cayley graphs
Journal of Combinatorial Theory, Series B, 1979 AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff.
openaire +3 more sources
Electronic Notes in Discrete Mathematics, 2002 Abstract A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a chordless cycle whose length is odd and ...
Agnes V. Dizon-Garciano +2 more
openaire +1 more source
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
Labelled tree graphs, Feynman diagrams and disk integrals
Journal of High Energy Physics, 2017 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