Results 151 to 160 of about 141,920 (188)
Some of the next articles are maybe not open access.
Prime labeling and prime distance labeling of some simple graphs
AIP Conference Proceedings, 2023Ram Dayal +3 more
openaire +1 more source
Prime labeling and prime distance labeling of some classes of graphs
AIP Conference Proceedings, 2023Ram Dayal, A. Parthiban
openaire +1 more source
k-PRIME TOTAL LABELING OF GRAPHS
Advances and Applications in Discrete Mathematics, 2022Arockiamary, S. Teresa +2 more
openaire +2 more sources
On Prime Distance Labeling of Graphs
2017A graph G is a prime distance graph if its vertices can be labeled with distinct integers in such a way that for any two adjacent vertices, the absolute difference of their labels is a prime number. It is known that cycles and bipartite graphs are prime distance graphs. In this paper we derive certain general results concerning prime distance labeling.
A. Parthiban, N. Gnanamalar David
openaire +1 more source
Communications on Applied Nonlinear Analysis
Let G be a graph. A bijection f:V→ {1,2,…..|V|} is called a prime labeling [3] if for each edge e=uv in E, we have GCD{ f(u),f(v)}=1. A graph that admits a prime labeling is said to be a prime graph. In this paper we show that bull graph admits Prime labeling in the context of variety graph operations namely duplication of vertex, fusion of vertices ...
openaire +1 more source
Let G be a graph. A bijection f:V→ {1,2,…..|V|} is called a prime labeling [3] if for each edge e=uv in E, we have GCD{ f(u),f(v)}=1. A graph that admits a prime labeling is said to be a prime graph. In this paper we show that bull graph admits Prime labeling in the context of variety graph operations namely duplication of vertex, fusion of vertices ...
openaire +1 more source
Prime Labeling Of Goldner Harary Graph
Louis Savenien Dupuis Journal of Multidisciplinary ResearchA 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 Goldner Harary graph admits prime labeling. We establish prime labeling using some graph operations such as duplication. Switching and fusion with few ideas.
K. Bharatha Devi, S. Lakshmi Narayanan
openaire +1 more source
PD-prime cordial labeling of graphs
2019vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$.
Ponraj, R +2 more
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Prime labeling of certain graphs*
Bulletin of Pure & Applied Sciences- Mathematics and Statistics, 2021J. Jeba Jesintha +2 more
openaire +1 more source