Zobrazeno 1 - 10
of 114
pro vyhledávání: '"prime labeling"'
Autor:
Abughneim Omar A., Abughazaleh Baha’
Publikováno v:
Open Mathematics, Vol 22, Iss 1, Pp 365-3566 (2024)
In the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are l
Externí odkaz:
https://doaj.org/article/3178320beb4341d7a5ade9b4940d11fa
Autor:
Abughazaleh, Baha' a, Abughneim, Omar A. b, ⁎
Publikováno v:
In Heliyon 30 January 2024 10(2)
Autor:
Baha' Abughazaleh, Omar A. Abughneim
Publikováno v:
Heliyon, Vol 10, Iss 2, Pp e23979- (2024)
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. Studying prime labeling in graphs
Externí odkaz:
https://doaj.org/article/a5bcb4dcb9444f93bade6455cbb41547
Autor:
Janani R, Ramachandran T
Publikováno v:
Ratio Mathematica, Vol 48, Iss 0 (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 posi
Externí odkaz:
https://doaj.org/article/783dc1cadb624956a887b46f24a7d710
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Procedia Computer Science 2020 172:649-654
Autor:
Stephen James Curran
Publikováno v:
Theory and Applications of Graphs, Vol 9, Iss 1, Pp 1-14 (2022)
It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn. We show that PpxPn has a prime labeling for any odd prime p and any integer n such that that p
Externí odkaz:
https://doaj.org/article/10578f24d5c04c478dd8ff2110669f75
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
Autor:
K Palani, A Shunmugapriya
Publikováno v:
Ratio Mathematica, Vol 45, Iss 0 (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]. A Gaussian integer \gamma=a+ib\in\mathbb{Z}[i] is prime if and only if either \gamm
Externí odkaz:
https://doaj.org/article/4f9f24801e2546eebc902152a62f321a
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.