Results 11 to 20 of about 612,378 (298)

Prime labeling of graphs constructed from wheel graph [PDF]

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.
Omar Abughneim
exaly   +4 more sources

Prime labeling of families of trees with Gaussian integers [PDF]

AKCE International Journal of Graphs and Combinatorics, 2016
A graph on n vertices is said to admit a prime labeling if we can label its vertices with the first n natural numbers such that any two adjacent vertices have relatively prime labels.
Steven Klee
exaly   +4 more sources

On prime labellings [PDF]

Discrete Mathematics, 1994
The paper is devoted to the study of prime graphs, that is finite graphs that admit a prime labelling. A prime labelling of a graph \(G=(V,E)\) is a bijection \(f: V\to \{1,2,\dots,| V|\}\) such that if \(e= \{u,v\}\in E\) then \(\text{GCD}(f(u),f(v))= 1\). Some results concerning bipartite graphs are obtained; all trees of order up to 15 are proved to
Hung-Lin Fu, Kuo-Ching Huang
openaire   +4 more sources

Prime labeling in the context of web graphs without center

AKCE International Journal of Graphs and Combinatorics, 2021
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
S K Patel, Ankur Kansagara
exaly   +2 more sources

Gaussian Twin Neighborhood Prime Labeling on Fan Digraphs [PDF]

Ratio Mathematica, 2023
Gaussian integers are complex numbers of the form \gamma=x+iy where x and y are integers and i^2=-1. The set of Gaussian integers is usually denoted by \mathbb{Z}[i].
K Palani, A Shunmugapriya
doaj   +2 more sources

Prime Cordial Labeling

Circulation in Computer Science, 2017
We show that some special families of graphs have prime cordial labeling. We prove that If G is not a prime cordial graph of order m then G∪K_(1,n)is a prime cordial graph if E(G)= n-1,n or n+1 , and we prove that S^' (K_(2,n)), Jelly fish graph , Jewel graph, the graph obtained by duplicating a vertex v_k in the rim of the helm H_nand the graph ...
M. A. Seoud, A. T. M. Matar, R. A. Al-Zuraiqi   +2 more
openaire   +2 more sources

Prime and Odd Prime Labelings on Cycle-Related Graphs

Science and Technology Indonesia
Graph labeling is the process of determining integer values for vertices, edges, or both, based on certain criteria. Let G be a simple graph with the finite vertex set V(G). Prime labeling of G is a bijection ⍺:V(G)→{1,2,…,|V(G)|} for which each pair of
Hafif Komarullah, Noor Hidayat, Vira Hari Krisnawati, Kristiana Wijaya   +3 more
doaj   +2 more sources

PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS

Barekeng
Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph  with a vertex-set  and an edge-set .
Desi Rahmadani, Ardi Aldiansyah, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari   +4 more
doaj   +2 more sources

Octagonal prime graceful labeling

Ratio Mathematica
Let G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all ...
V Akshaya
doaj   +2 more sources

On Prime Labeling Of Herschel Graph

, 2016
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct integers such that for each the labels assigned to and are relatively prime. A graph which admits prime labeling is called a prime graph.In this paper, we investigate prime labeling of Herschel graph.
V. Ganesan, Dr. K. Balamurugan
openaire   +3 more sources