distance labeling
Recently Published Documents


TOTAL DOCUMENTS

31
(FIVE YEARS 4)

H-INDEX

7
(FIVE YEARS 0)

2021 ◽  
Author(s):  
Wentao Li ◽  
Miao Qiao ◽  
Lu Qin ◽  
Ying Zhang ◽  
Lijun Chang ◽  
...  
Keyword(s):  

Author(s):  
Aviv Bar-Natan ◽  
Panagiotis Charalampopoulos ◽  
Paweł Gawrychowski ◽  
Shay Mozes ◽  
Oren Weimann

2021 ◽  
Vol 9 (1) ◽  
pp. 557-561
Author(s):  
Ajay Kumar ◽  
Ajendra Kumar ◽  
Vipin Kumar ◽  
Kamesh Kumar
Keyword(s):  

2020 ◽  
Vol 9 (11) ◽  
pp. 9237-9245
Author(s):  
P. Poomalai ◽  
R. Vikramaprasad ◽  
P. Malliga
Keyword(s):  

A Radio Analytic Mean D-distance labeling of associated diagram $G$ is a balanced guide $v$ from the vertex set $V(G)$ to $N$ such that for two distinct vertices $u$ and $v$ of $G$. $d^D\left(u,v\right) +\left\lceil \frac{\left|f({u)}^2-f(v)^2\right|}{2}\right\rceil \ge 1+\ {diam}^{D\ }(G)$.


2020 ◽  
Vol 9 (8) ◽  
pp. 5785-5794
Author(s):  
P. Poomalai ◽  
R. Vikramaprasad ◽  
P. Malliga
Keyword(s):  

2020 ◽  
Vol 1531 ◽  
pp. 012062
Author(s):  
A. Parthiban ◽  
Ajaz Ahmad Pir ◽  
A. Felix
Keyword(s):  

Let be the set of all integers. A graph is a prime distance graph if there exists an injective function such that for any two adjacent vertices and , the integer is a prime. So is a prime distance graph if and only if there exists a prime distance labeling of . If the edge labels of are also distinct, then is called a distinct prime distance labeling of and is called a distinct prime distance graph. The generalized Petersen graphs are defined to be a graph on vertices with and , subscripts modulo . In this paper, we show that the generalized Petersen graphs permit a prime distance labeling for all even and conjecture that and admit a prime distance labeling for any and all odd , respectively. We also prove that the cycle admits a distinct prime distance labeling for all , besides establishing the prime distance labeling for some graphs.


Sign in / Sign up

Export Citation Format

Share Document