Results 1 to 10 of about 313,722 (173)
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
Determination of the prime bound of a graph [PDF]
Given a graph $G$, a subset $M$ of $V(G)$ is a module of $G$ if for each $v\in V(G)\setminus M$, $v$ is adjacent to all the elements of $M$ or to none of them. For instance, $V(G)$, $\emptyset$ and $\{v\}$ ($v\in V(G)$) are modules of $G$ called trivial.
Boussaïri, Abderrahim, Ille, Pierre
core +6 more sources
In prime labeling, vertices are labeled from 1 to n, with the condition that any two adjacent vertices have relatively prime labels. Coprime labeling maintains the same criterion as prime labeling with adjacent vertices using any set of distinct positive
Janani R, Ramachandran T
doaj +2 more sources
On minimal prime extensions of a four-vertex graph in a prime graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Brandstadt +2 more
exaly +3 more sources
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in &Gamma ...
Hossein Moradi +2 more
doaj +3 more sources
In the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are labeled with ...
Abughneim Omar A., Abughazaleh Baha’
doaj +2 more sources
Prime labeling of graphs constructed from wheel graph
A prime labeling of a simple undirected graph G is to assign unique integer labels from the set {1,2,...,|V(G)|} to each vertex such that any two adjacent vertices in the graph have labels that are relatively prime.
Baha' Abughazaleh, Omar A. Abughneim
doaj +3 more sources
A novel approach to explore common prime divisor graphs and their degree based topological descriptor. [PDF]
For the construction of a common prime divisor graph, we consider an integer [Formula: see text] with its prime factorization, where [Formula: see text] are distinct primes and [Formula: see text] are fixed positive integers. Every divisor of the integer
Ali N A Koam +3 more
doaj +2 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
Prime Graph over Cartesian Product over Rings and Its Complement
Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc.
Farah Maulidya Fatimah +2 more
doaj +1 more source

