Results 1 to 10 of about 1,962,778 (284)

𝒌𝒕𝒉 FIBONACCI PRIME LABELING OF SNAKE GRAPHS [PDF]

Journal of Mechanics of Continua and Mathematical Sciences
kth Fibonacci Prime Labeling is defined as labeling the vertices of a graph with distinct Fibonacci numbers starting since the kth Fibonacci term sustaining the condition that the 𝑔𝑐𝑑(𝑓(𝑢), 𝑓(𝑣)) = 1, where 𝑓(𝑢) and 𝑓(𝑣) are labels of any adjacent ...
Anna S. Varghese, Gerard Rozario Joseph, Lawrence Rozario Raj P.   +2 more
doaj   +3 more sources

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.
Baha' Abughazaleh, Omar A. Abughneim
doaj   +2 more sources

Prime Labeling of Nauru Graph

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   +2 more sources

Conflict vs Causality in Event Structures [PDF]

Electronic Proceedings in Theoretical Computer Science, 2019
Event structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the literature.
Daniele Gorla, Ivano Salvo, Adolfo Piperno   +2 more
doaj   +5 more sources

Common closed neighbourhood prime labeling

Journal of Physics: Conference Series, 2021
AbstractLetG= (VG,EG) be a connected graph of ordern.A bijectiong:VG→ {1,2,3,…,n} is said to be prime labeling if for each two distinct verticesa,b ∈Vcwhichais adjacent tob, gcd(g(a),g(b))= 1. A graph that satisfies the prime labeling is called a prime graph. Graph G is a neighbourhood prime graphif there is a bijectiong: VG→{1,2,3,…,n}so that for each
null Rinurwati, A S Alfiyani
openaire   +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

Neighborhood-Prime Labeling

International Journal of Mathematics and Soft Computing, 2015
In this paper we introduce neighborhood-prime labeling and investigate neighborhoodprime labelings for paths, cycles, helm, closed helm and flower. Also we establish a sufficient condition for a graph to admit neighborhood-prime labeling.
N. N. Shrimali, S. K. Patel
openaire   +2 more sources

Prime Labeling of Jahangir Graphs

International Journal of Engineering & Technology, 2018
The paper investigates prime labeling of Jahangir graph Jn,m   for n ≥ 2, m ≥ 3 provided that nm is even. We discuss prime labeling of some graph operations viz. Fusion, Switching and Duplication to prove that the Fusion of two vertices v1 and vk where k is odd in a Jahangir graph Jn,m results to prime graph provided that the product nm is even ...
Anantha Lakshmi., Jayalakshmi. K, Madhavi T   +2 more
openaire   +3 more sources

On odd prime labeling of graphs

Open Journal of Discrete Applied Mathematics, 2020
In this paper we give a new variation of the prime labeling. We call a graph \(G\) with vertex set \(V(G)\) has an odd prime labeling if its vertices can be labeled distinctly from the set \(\big\{1, 3, 5, ...,2\big|V(G)\big| -1\big\}\) such that for every edge \(xy\) of \(E(G)\) the labels assigned to the vertices of \(x\) and \(y\) are relatively ...
Maged Zakaria Youssef, Zainab Saad Almoreed   +1 more
openaire   +2 more sources

On Prime Index of a Graph

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   +1 more source