Results 51 to 60 of about 312,012 (172)
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
ON THE PRIME GRAPH OF SIMPLE GROUPS [PDF]
Bulletin of the Australian Mathematical Society, 2014 AbstractLet $G$ be a finite group, let ${\it\pi}(G)$ be the set of prime divisors of $|G|$ and let ${\rm\Gamma}(G)$ be the prime graph of $G$. This graph has vertex set ${\it\pi}(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an element of order $rs$.
Burness, Tim C, Covato, Elisa
openaire +3 more sources
Some Characteristics of the Prime Graph of Integer Modulo Groups
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 +1 more source
On the Prime Graph Question for Integral Group Rings of 4-primary groups I
, 2017 We study the Prime Graph Question for integral group rings. This question can be reduced to almost simple groups by a result of Kimmerle and Konovalov. We prove that the Prime Graph Question has an affirmative answer for all almost simple groups having a
Bächle, Andreas, Margolis, Leo
core +2 more sources
Quasirecognition by prime graph of U_3(q) where 2 < q =p^{alpha} < 100 [PDF]
International Journal of Group Theory, 2012 Let G be a finite group and let Gamma(G) be the prime graphof G. Assume 2 < q = p^{alpha} < 100 . We determine finite groupsG such that Gamma(G) = Gamma(U_3(q)) and prove that if q neq3, 5, 9, 17, then U_3(q) is quasirecognizable by prime graph,i.e., if ...
Ali Iranmanesh +3 more
doaj
On nonsolvable groups whose prime degree graphs have four vertices and one triangle [PDF]
International Journal of Group Theory, 2018 Let $G$ be a finite group. The prime degree graph of $G$, denoted by $Delta(G)$, is an undirected graph whose vertex set is $rho(G)$ and there is an edge between two distinct primes $p$ and $q$ if and only if $pq$ divides some irreducible ...
Roghayeh Hafezieh
doaj +1 more source
, 2015 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi, Lorenzo
core +2 more sources
, 2017 Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that if each edge is assigned the label when gcd and otherwise, then the difference between the number of edges labeled with and the number of edges labeled with is at most . A graph which admits prime cordial labeling is called a prime cordial graph. In
M. Bhuvaneshwari +2 more
openaire +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
The Second Subconstituent of some Strongly Regular Graphs [PDF]
, 2010 This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts.
Biggs, Norman
core +1 more source