Results 31 to 40 of about 33,385 (288)
Supermagic Coverings of Some Simple Graphs [PDF]
Showing that edge amalgamation of a finite collection of graphs isomorphic to any 2-connected simple graph H is H ...
Selvagopal, P., Jeyanthi, P.
core +1 more source
Random Cyclic Triangle-Free Graphs of Prime Order
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
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
Finite groups whose character degree graphs coincide with their prime graphs [PDF]
Veliev, Oktay A. (Dogus Author)In the literature, there are several graphs related to a finite group G. Two of them are the character degree graph, denoted by ΔG), and the prime graph ΓG), In this paper we classify all finite groups whose character ...
Temha Erkoç +8 more
core +1 more source
On the power graphs of elementary abelian and extra special $p$-groups [PDF]
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
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 Labeling of H- Super Subdivision of Y-tree Related Graphs
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
Prime ideal graphs of commutative rings
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
On minimal prime extensions of a four-vertex graph in a prime graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Brandstädt +2 more
openaire +2 more sources

