Results 1 to 10 of about 994,076 (215)
Electronic Notes in Discrete Mathematics, 2016 Abstract Let R be a commutative ring with two binary operators addition (+) and multiplication (.). Then Z n is a ring of integers modulo n, where n is a positive integer. A Absorption Cayley graph denoted by Ω ( Z n ) is a graph whose vertex set is Z n , the integer modulo n and edge set E = { a b ...
Deepa Sinha, Deepakshi Sharma
exaly +3 more sources
Color Energy Of A Unitary Cayley Graph
Discussiones Mathematicae Graph Theory, 2014 Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al.
Adiga Chandrashekar +2 more
doaj +2 more sources
On transitivity and connectedness of Cayley graphs of gyrogroups [PDF]
Heliyon, 2021 In this work, we explore edge direction, transitivity, and connectedness of Cayley graphs of gyrogroups. More specifically, we find conditions for a Cayley graph of a gyrogroup to be undirected, transitive, and connected.
Rasimate Maungchang +3 more
doaj +2 more sources
On the Unitary Cayley Graph of a Ring [PDF]
The Electronic Journal of Combinatorics, 2012 Let $R$ be a ring with identity. The unitary Cayley graph of a ring $R$, denoted by $G_{R}$, is the graph, whose vertex set is $R$, and in which $\{x,y\}$ is an edge if and only if $x-y$ is a unit of $R$.
D. Kiani, M. Aghaei
semanticscholar +3 more sources
Neighborhood degree sum-based molecular descriptors of fractal and Cayley tree dendrimers. [PDF]
Eur Phys J Plus, 2021 Topological index is a connection between the chemical structure and the real number that remains invariant under graph isomorphism. In structure–property and structure–activity modeling, topological indices are considered as essential molecular ...
Mondal S, De N, Pal A.
europepmc +2 more sources
CoRRIn spite of the plethora of success stories with graph neural networks (GNNs) on modelling graph-structured data, they are notoriously vulnerable to over-squashing, whereby tasks necessitate the mixing of information between distance pairs of nodes.
JJ Wilson +2 more
semanticscholar +4 more sources
Hamiltonian Normal Cayley Graphs
Discussiones Mathematicae Graph Theory, 2019 A variant of the Lovász Conjecture on hamiltonian paths states that every finite connected Cayley graph contains a hamiltonian cycle. Given a finite group G and a connection set S, the Cayley graph Cay(G, S) will be called normal if for every g ∈ G we ...
Montellano-Ballesteros Juan José +1 more
doaj +3 more sources
The Electronic Journal of Combinatorics, 2022 We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
Xiaogang Liu, Sanming Zhou
openaire +3 more sources
On the Cayley graph of a generic finitely presented group
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2004 G. Arzhantseva, P. Cherix
exaly +2 more sources
Roughness in Cayley graphs [PDF]
Information Sciences, 2010 In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is expanded to pseudo-Cayley graphs.
M. H. Shahzamanian +2 more
openaire +4 more sources