Results 11 to 20 of about 1,036,687 (287)
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
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\), denoted by \(G_{p}(R)\).
Nikmehr, M. J., Soleymanzadeh, B.
openaire +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
Some Characteristics of the Prime Graph of Integer Modulo Groups [PDF]
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 +2 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 +4 more sources
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
Odd Prime Labeling For Some Arrow Related Graphs
Ratio Mathematica, 2023 In a graph G a mapping g is known as odd prime labeling , if g is a bijection from V to f1; 3; 5; ::::; 2jVj - 1g satisfying the condition that for each line xy in G the gcd of the labels of end points (g(x); g(y)) is one.
Gajalakshmi G, Meena S
doaj +1 more source
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 prime labeling of union of tadpole graphs [PDF]
, 2022 Let G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for each e = {u, v} in E, we have GCD(f(u),f(ʋ)) = 1. A graph admits a prime labelling is called a prime graph. Around ten years ago, Roger Entriger conjectured that
Patel, Sanjaykumar K., Vasava, Jayesh B.
core +2 more sources
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