Results 21 to 30 of about 30,352 (163)
Random Cyclic Triangle-Free Graphs of Prime Order
Journal of Mathematics, 2021 Cyclic triangle-free process (CTFP) is the cyclic analog of the triangle-free process. It begins with an empty graph of order n and generates a cyclic graph of order n by iteratively adding parameters, chosen uniformly at random, subject to the ...
Yu Jiang +3 more
doaj +1 more source
Relatively Prime Detour Domination Number of Some Switching Graphs
Ratio Mathematica, 2023 In this paper, we introduce the concept of relatively prime detour domination number for switching graph. If a set S ⊆ V is a detour set, a dominating set with at least two elements, and has (deg(u), deg(v)) = 1 for each pair of vertices u and v, then it
C Jayasekaran, L. G. Binoja
doaj +1 more source
On the power graphs of elementary abelian and extra special $p$-groups [PDF]
International Journal of Group Theory, 2021 For a given odd prime $p$, we investigate the power graphs of three classes of finite groups: the elementary abelian groups of exponent $p$, and the extra special groups of exponents $p$ or $p^2$. We show that these power graphs are Eulerian for
Masoud Pourhasan, Hossein Doostie
doaj +1 more source
Prime labelings on planar grid graphs
Theory and Applications of Graphs, 2022 It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn.
Stephen James Curran
doaj +1 more source
Prime ideal graphs of commutative rings
Indonesian Journal of Combinatorics, 2022 Let R be a finite commutative ring with identity and P be a prime ideal of R. The vertex set is R - {0} and two distinct vertices are adjacent if their product in P. This graph is called the prime ideal graph of R and denoted by ΓP.
Haval Mohammed Salih, Asaad A. Jund
doaj +1 more source
Discrete Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Wasit Journal of Pure sciences, 2023 In this paper, we presented a new properties of a weakly completely prime graph, where we added the algebraic properties in this graph and extracted from them some important theories and results, with the study of homomorphism in this graph when homomorphism is available in near rings, as well as the definition of homomorphism preserve vertex ...
ameer al-swidi, Ahmed A.Omran
openaire +2 more sources
Prime Labeling of H- Super Subdivision of Y-tree Related Graphs
Ratio Mathematica, 2023 A graph G with p points is called a prime labeling , if it possible to label the points x 2 V with distinct labels f(x) from f1;2; :::; pg in such a way that for each line e = uv gcd (f(u); f(v)) = 1 .
Meena S, Gajalakshmiy G
doaj +1 more source
Neutrosophic Quadratic Residues and Non-Residues [PDF]
Neutrosophic Sets and Systems, 2021 In this paper, we present the Neutrosophic quadratic residues and nonresidues with their basic interpretation as graphs in an algebraic manner and analog to the algebraic graphs.
Chalapathi Tekuri +2 more
doaj +1 more source
, 2022 An odd prime labeling is a variation of a prime labeling in which the vertices of a graph of order~$n$ are labeled with the distinct odd integers $1$ to $2n-1$ so that the labels of adjacent vertices are relatively prime. This paper investigates many different classes of graphs including disjoint unions of cycles, stacked prisms, and particular types ...
Carter, Holly, Fox, N. Bradley
openaire +2 more sources