Results 31 to 40 of about 912,801 (279)
Recognition by degree prime-power graph and order of some characteristically simple groups [PDF]
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
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
Classifying Character Degree Graphs with Seven Vertices [PDF]
We study here the graphs with seven vertices in an effort to classify which of them appear as the prime character degree graphs of finite solvable groups. This classification is complete for the disconnected graphs.
Jacob Laubacher +2 more
doaj +1 more source
Tiling of Prime and Composite Kirchhoff Graphs
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. We present an algorithm that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. We explore the tiling of prime Kirchhoff graphs.
Wang, Jessica
core +3 more sources
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
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 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 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 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
Explicit prime labelings for families of unicyclic graphs with star and path attachments
A graph G admits a prime labeling if its vertices can be assigned the integers 1,2,. . . ,|V(G)| so that every pair of adjacent vertices receives coprime labels; a graph with this property is called a prime graph.
O. A. AbuGhneim, B. Abughazaleh
doaj +1 more source

