Results 81 to 90 of about 313,722 (173)
On the relation between the non-commuting graph and the prime graph [PDF]
International Journal of Group Theory, 2012 Given a non-abelian finite group $G$, let $pi(G)$ denote the set of prime divisors of the order of $G$ and denote by $Z(G)$ the center of $G$. Thetextit{ prime graph} of $G$ is the graph with vertex set $pi(G)$ where two distinct primes $p$ and $q$ are ...
N. Ahanjideh, A. Iranmanesh
doaj
Journal of CombinatoricsThe decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications. In this paper, we utilize tools from group theory and ring theory to study this problem when the network is a Cayley graph.
Chudnovsky, Maria +6 more
openaire +2 more sources
Almost-Ramanujan graphs and prime gaps
European Journal of Combinatorics, 2015 The method of Murty and Cioabă shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus eliminates the need for computation.
openaire +4 more sources
Prime graphs and exponential composition of species
Journal of Combinatorial Theory, Series A, 2008 30 pages, 7 figures, 1 ...
openaire +3 more sources
Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Hellmuth +2 more
openaire +2 more sources
CONSTRUCT THE TRIPLE ZERO GRAPH OF RING Z_n USING PYTHON
BarekengLet be a commutative ring with nonzero identity and there exists such that , , , denotes the set of all triple zero elements of . The triple zero graph of , denoted by , is an undirected graph with vertex set where two distinct vertices
Putri Wulandari +2 more
doaj +1 more source
THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n
BarekengLet be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source
Presented in Computing Conference 2025 held at London, UK during June 19 - 20 ...
openaire +2 more sources