Results 1 to 10 of about 232,773 (225)
On the prime graph of simple groups [PDF]
Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an element of order $rs$
Burness, Timothy C., Covato, Elisa
core +4 more sources
Prime power and prime product distance graphs [PDF]
A graph $G$ is a $k$-prime product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the product of at most $k$ primes. A graph has prime product number $ppn(G)=k$ if it is a $k$-prime product graph but not a $(k-1)$-prime product graph.
Joshua D Laison
exaly +4 more sources
ON FINITE PRIME DISTANCE GRAPHS
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Parthiban, G Samdanielthompson
exaly +3 more sources
Finite prime distance graphs and 2-odd graphs
A graph $G$ is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs ...
Joshua D Laison
exaly +4 more sources
A characterization of the prime graphs of solvable groups
20 pages, 5 ...
Thomas Michael Keller, Mark L Lewis
exaly +4 more sources
Prime graphs and exponential composition of species
30 pages, 7 figures, 1 ...
exaly +4 more sources
Prime labeling of graphs constructed from wheel graph
الملخص إن التسمية الرئيسية للرسم البياني البسيط غير الموجه G هي تعيين تسميات أعداد صحيحة فريدة من المجموعة {1،2،....،|V \( G\)|} لكل رأس بحيث يكون لأي رأسين متجاورين في الرسم البياني تسميات أولية نسبيًا. يمكن أن تساعدنا دراسة العلامات الرئيسية في الرسوم البيانية على فهم بنية وخصائص الرسوم البيانية والعلامات الرئيسية لها تطبيقات محتملة في التشفير وأمن ...
Baha' Abughazaleh, Omar A AbuGhneim
exaly +4 more sources
Birecognition of prime graphs, and minimal prime graphs
Given a graph [Formula: see text], a subset [Formula: see text] of [Formula: see text] is a module of [Formula: see text] if for each [Formula: see text], [Formula: see text] is adjacent to all the elements of [Formula: see text] or to none of them.
Houmem Belkhechine +2 more
openaire +4 more sources
On Minimal Prime Graphs and Posets [PDF]
We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.
Pouzet, Maurice, Zaguia, Imed
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

