Results 1 to 10 of about 302 (107)
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 +5 more sources
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
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
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.
Maurice Pouzet, Imed Zaguia
exaly +4 more sources
On Minimal Prime Extensions of a Four-Vertex Graph in a Prime Graph
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chính T. Hoàng +2 more
exaly +5 more sources
A Distance Measure for Large Graphs Based on Prime Graphs [PDF]
Pattern Recognition, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamida Seba
exaly +6 more sources
Ratio Mathematica, 2023 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
Finite Prime Distance Graphs and 2-Odd Graphs
Discrete Mathematics, 2013 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 Douglass Laison
exaly +5 more sources
A Characterization of the Prime Graphs of Solvable Groups
Journal of Algebra, 2015 20 pages, 5 ...
Mark Lanning Lewis +1 more
exaly +4 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 +2 more
openaire +5 more sources