Results 1 to 10 of about 30,352 (163)
Open MathematicsIn 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
$4$-Regular prime graphs of nonsolvable groups [PDF]
International Journal of Group Theory, 2020 Let $G$ be a finite group and $\cd(G)$ denote the character degree set for $G$. The prime graph $\DG$ is a simple graph whose vertex set consists of prime divisors of elements in $\cd(G)$, denoted $\rho(G)$.
Donnie Kasyoki, Paul Oleche
doaj +3 more sources
Ratio Mathematica, 2023 For a graph G, a bijection f is called an odd prime labeling , if f from V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatest common divisor of the labels of end vertices (f(u); f(v)) is one.
Meena S, Gajalakshmiy G
doaj +2 more sources
A novel approach to explore common prime divisor graphs and their degree based topological descriptor. [PDF]
PLoS ONEFor 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
Prime labeling of graphs constructed from wheel graph
HeliyonA 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
Birecognition of prime graphs, and minimal prime graphs
Discrete Mathematics, Algorithms and Applications, 2021 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.
Ille, Pierre +2 more
openaire +4 more sources
Odd Prime Labeling For Some Arrow Related Graphs
Ratio Mathematica, 2023 In a graph G a mapping g is known as odd prime labeling , if g is a bijection from V to f1; 3; 5; ::::; 2jVj - 1g satisfying the condition that for each line xy in G the gcd of the labels of end points (g(x); g(y)) is one.
Gajalakshmi G, Meena S
doaj +1 more source
A new characterization of some characteristically simple groups [PDF]
AUT Journal of Mathematics and Computing, 2023 Let $G$ be a finite group and $\mathrm{cd}(G)$ be the set of irreducible complex character degrees of $G$. It was proved that some finite simple groups are uniquely determined by their orders and their degree graphs.
Zohreh Sayanjali
doaj +1 more source
Prime power and prime product distance graphs [PDF]
Discrete Applied Mathematics, 2019 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.
Kaneda, Yumi +3 more
openaire +3 more sources
Classifying families of character degree graphs of solvable groups [PDF]
International Journal of Group Theory, 2019 We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion.
Mark Bissler, Jacob Laubacher
doaj +1 more source