Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Gajalakshmiy G"'
Autor:
Meena S, Gajalakshmiy G
Publikováno v:
Ratio Mathematica, Vol 46, Iss 0 (2023)
For a graph G, a bijection f is called an odd prime labeling , if f from V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatest common divisor of the labels of end vertices (f(u); f(v)) is one. In this paper we investigate the existence o
Externí odkaz:
https://doaj.org/article/5542ded170f74f64bb400d10d6742565
Autor:
Meena S, Gajalakshmiy G
Publikováno v:
Ratio Mathematica, Vol 46, Iss 0 (2023)
A graph G with p points is called a prime labeling , if it possible to label the points x 2 V with distinct labels f(x) from f1;2; :::; pg in such a way that for each line e = uv gcd (f(u); f(v)) = 1 . In this paper we prove that some classes of grap
Externí odkaz:
https://doaj.org/article/9b3674495e014e1886fb0fe7e1792170