Results 31 to 40 of about 1,529,529 (310)
Introduction to dominated edge chromatic number of a graph [PDF]
Opuscula Mathematica, 2021 We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph \(G\), is a proper edge coloring of \(G\) such that each color class is dominated by at least one edge of \(G\).
Mohammad R. Piri, Saeid Alikhani
doaj +1 more source
Mathematics of Computation, 1979 Let p n {p_n} denote the nth prime. The prime number graph is the set of lattice points ( n , p n ) (n,{p_n}) , n = 1 , 2 , … n = 1,2 ...
openaire +1 more source
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
Recognition by degree prime-power graph and order of some characteristically simple groups [PDF]
AUT Journal of Mathematics and Computing, 2021 In this paper, by the order of a group and triviality of $O_p(G)$ for some prime $p$, we give a new characterization for some characteristically simple groups. In fact, we prove that if {$p \in \{5, 17, 23, 37, 47, 73\}$ and $n \leqslant p$, where $n$ is
Afsane Bahri +2 more
doaj +1 more source
On unavoidable‐induced subgraphs in large prime graphs [PDF]
Journal of Graph Theory, 2015 Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present article, we reprove their theorem using many of the same ideas, but with the key model‐theoretic ...
M. Malliaris, C. Terry
semanticscholar +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 co-prime order graphs of finite abelian p-groups
Journal of Mathematics and Computer Science, 2021 For a finite group G, the co-prime order graph Θ(G) of G is defined as the graph with vertex set G, the group itself, and two distinct vertices u, v in Θ(G) are adjacent if and only if gcd(o(u),o(v)) = 1 or a prime number.
M. Saini +3 more
semanticscholar +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 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