Results 21 to 30 of about 2,976 (243)
The prime ideals intersection graph of a ring [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2017 summary:Let $R$ be a commutative ring with unity and $U(R)$ be the set of unit elements of $R$. In this paper, we introduce and investigate some properties of a new kind of graph on the ring $R$, namely, the prime ideals intersection graph of $R ...
Nikmehr, M. J., Soleymanzadeh, B.
core +2 more sources
On finite groups with disconnected prime graph [PDF]
Proceedings of the Steklov Institute of Mathematics, 2013 All finite simple nonabelian groups that have the same prime graph as a Frobenius group or a 2-Frobenius group are found.
V D Mazurov, Mazurov V D
exaly +2 more sources
Open MathematicsIn the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are labeled with ...
Abughneim Omar A., Abughazaleh Baha’
doaj +2 more sources
Some Characteristics of the Prime Graph of Integer Modulo Groups
InPrime, 2023 The notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are ...
Muklas Maulana +3 more
doaj +3 more sources
Quasirecognition by prime graph of finite simple groups ${}^2D_n(3)$ [PDF]
International Journal of Group Theory, 2014 Let $G$ be a finite group. In [Ghasemabadi et al., characterizations of the simple group ${}^2D_n(3)$ by prime graph and spectrum, Monatsh Math., 2011] it is proved that if $n$ is odd, then ${}^2D _n(3)$ is recognizable by prime graph and also by ...
Behrooz Khosravi , Hossein Moradi
doaj +1 more source
Prime labeling of graphs constructed from wheel graph
HeliyonA prime labeling of a simple undirected graph G is to assign unique integer labels from the set {1,2,...,|V(G)|} to each vertex such that any two adjacent vertices in the graph have labels that are relatively prime.
Baha' Abughazaleh, Omar A. Abughneim
doaj +3 more sources
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 +1 more source
On the prime graph of Dn(q) where q ∊ {2, 5}
Quaestiones Mathematicae, 2013 Let G be a nite group. The prime graph Γ(G) of G is de ned as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, p′ are joined by an edge if G has an element of order pp′.
Zeinab Akhlaghi +2 more
exaly +1 more source
Prime labeling in the context of web graphs without center
AKCE International Journal of Graphs and Combinatorics, 2021 A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
A. N. Kansagara, S. K. Patel
doaj +1 more source
Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs
Ratio Mathematica, 2023 If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set.
A Jancy Vini, C Jayasekaran
doaj +1 more source