Results 11 to 20 of about 374,945 (254)
Prime labelings of all prime generalized Petersen graphs with at most 100 vertices [PDF]
, 2016 This document contains prime labelings of all prime generalized Petersen graphs with at most 100 ...
Schluchter, S., Wilson, T.
core +1 more source
Prime labelings of all cubic bipartite graphs with 22 vertices [PDF]
, 2016 This document contains prime labelings of all cubic bipartite graphs with 22 ...
Schluchter, S., Wilson, T.
core +1 more source
Prime labelings of all cubic bipartite graphs with 20 vertices [PDF]
, 2016 This document contains prime labelings of all cubic bipartite graphs with 20 ...
Schluchter, S., Wilson, T.
core +1 more source
On Prime Labelings of Uniform Cycle Snake Graphs [PDF]
, 2023 A prime labeling of a graph of order n is an assignment of the integers 1, 2, ... , n to the vertices such that each pair of adjacent vertices has coprime labels. For positive integers m, k, q with k ≥ 3 and 1 ≤ q ≤ ⌊k/
Ollis, Matt +2 more
core +1 more source
Prime Vertex Labelings of Several Families of Graphs [PDF]
, 2015 A simple and connected $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,\ldots, n$, such that adjacent vertices have relatively prime labels.
Hastings, Michael +8 more
core +1 more source
Prime labelings of cubic bipartite graphs with at least 10 vertices and at most 18 vertices [PDF]
, 2016 This document contains prime labelings of all cubic bipartite graphs with at least 10 and at most 18 ...
Schluchter, S., Wilson, T.
core +1 more source
Coprime and prime labelings of graphs
J. Integer Seq., 2016 14 pages, this version is the one accepted by the Journal of Integer ...
Adam H. Berliner +5 more
openaire +4 more sources
Prime Vertex Labelings of Families of Unicyclic Graphs [PDF]
, 2017 A simple n-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers 1 through n such that adjacent vertices have relatively prime labels.
Hastings, Michael +6 more
core +1 more source
International Journal For Multidisciplinary Research, 2023 A graph G = (V(G), E(G)) is observed to admit prime labeling, if a graph that receives prime labeling is called prime graph .In this research article we investigate that the Nauru graph admits prime labeling. We construct the mirror graph and shadow graph of the Nauru graph.
K.Bharatha Devi -, S.Lakshminarayanan -
openaire +1 more source
International Journal of Engineering & Technology, 2018 A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire +2 more sources