Results 41 to 50 of about 994,076 (215)
On the Unitary Cayley Graph of a Finite Ring
Electronic Journal of Combinatorics, 2009 We study the unitary Cayley graph associated to an arbitrary finite ring, determining precisely its diameter, girth, eigenvalues, vertex and edge connectivity, and vertex and edge chromatic number.
Reza Akhtar +6 more
semanticscholar +1 more source
Enumeration of Triangles in a Divisor Cayley Graph
, 2013 In this paper a new class of arithmetic Cayley graphs, namely, divisor Cayley graphs associated with the divisor function d ƒvnƒw , n „d1,an integer is introduced. It is shown that this graph is regular, hamiltonian, connected and not bipartite, and when
T. Chalapathi +2 more
semanticscholar +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
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
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
Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"
IEEE Trans. Parallel Distributed Syst., 1997 For original paper see Vadapalli and Srimani, ibid., vol. 7, no. 1, p 26-32, 1996, where the authors have proposed a new family of Cayley graph interconnection networks of constant degree four.
Guihai Chen, F. Lau
semanticscholar +1 more source
CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters [PDF]
IEEE Transactions on Signal Processing, 2017 The rise of graph-structured data such as social networks, regulatory networks, citation graphs, and functional brain networks, in combination with resounding success of deep learning in various applications, has brought the interest in generalizing deep
R. Levie +3 more
semanticscholar +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 +2 more sources
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 +4 more sources