Results 1 to 10 of about 641,798 (254)

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

Gaussian Twin Neighborhood Prime Labeling on Fan Digraphs [PDF]

Ratio Mathematica, 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].
K Palani, A Shunmugapriya
doaj   +2 more sources

Prime labeling in the context of web graphs without center

AKCE International Journal of Graphs and Combinatorics, 2021
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
A. N. Kansagara, S. K. Patel
doaj   +2 more sources

On Prime Index of a Graph [PDF]

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

Prime labelings on planar grid graphs [PDF]

Theory and Applications of Graphs, 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.
Stephen James Curran
doaj   +2 more sources

Even-Odd Prime Harmonious Graphs [PDF]

Pandian Journal of Mathematical Sciences, 2022
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method.
Dr R. S. Ramkumar
doaj   +2 more sources

Some New Odd prime Graphs

Ratio Mathematica, 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.
Meena S, Gajalakshmiy G
doaj   +1 more source

Odd Prime Labeling For Some Arrow Related Graphs

Ratio Mathematica, 2023
In a graph G a mapping g is known as odd prime labeling , if g is a bijection from V to f1; 3; 5; ::::; 2jVj - 1g satisfying the condition that for each line xy in G the gcd of the labels of end points (g(x); g(y)) is one.
Gajalakshmi G, Meena S
doaj   +1 more source

Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings

Theory and Applications of Graphs, 2022
Let $A$ be a nontrivial abelian group and $A^* = A \setminus \{0\}$. A graph is $A$-magic if there exists an edge labeling $f$ using elements of $A^*$ which induces a constant vertex labeling of the graph.
Richard Low, Dan Roberts
doaj   +1 more source

Prime Labeling of H- Super Subdivision of Y-tree Related Graphs

Ratio Mathematica, 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 .
Meena S, Gajalakshmiy G
doaj   +1 more source