Results 11 to 20 of about 782,126 (230)

On k-prime graphs

Open Mathematics
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   +3 more sources

A characterization of the prime graphs of solvable groups [PDF]

Journal of Algebra, 2015
20 pages, 5 ...
Mark L Lewis, Thomas Michael Keller
exaly   +5 more sources

Prime graphs and exponential composition of species [PDF]

Journal of Combinatorial Theory - Series A, 2008
30 pages, 7 figures, 1 ...
Li, Ji
exaly   +6 more sources

On Minimal Prime Graphs and Posets [PDF]

Order, 2009
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
core   +11 more sources

Prime labeling of graphs constructed from wheel graph

Heliyon
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   +5 more sources

Some New Odd prime Graphs

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

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.
Joshua D Laison
exaly   +5 more sources

Even-Odd Prime Harmonious Graphs [PDF]

Pandian Journal of Mathematical Sciences, 2022
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method.
Dr R. S. Ramkumar
doaj   +2 more sources

ON FINITE PRIME DISTANCE GRAPHS

Indian Journal of Pure and Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Parthiban
exaly   +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.
Houmem Belkhechine, Cherifa Ben Salha, Pierre Ille   +2 more
openaire   +6 more sources