Results 1 to 10 of about 141,920 (188)

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

Conflict vs Causality in Event Structures [PDF]

Electronic Proceedings in Theoretical Computer Science, 2019
Event structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the literature.
Daniele Gorla, Ivano Salvo, Adolfo Piperno   +2 more
doaj   +5 more sources

Octagonal prime graceful labeling

Ratio Mathematica
Let G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all ...
V Akshaya
doaj   +2 more sources

On Prime Index of a Graph

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   +1 more source

Prime labelings on planar grid graphs

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   +1 more source

Gaussian Twin Neighborhood Prime Labeling on Fan Digraphs

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   +1 more source

Borsuk-Ulam type theorems for G-spaces with applications to Tucker type lemmas [PDF]

, 2022
In this paper we consider several generalizations of the Borsuk-Ulam theorem for G-spaces and apply these results to Tucker type lemmas for G-simplicial complexes and PL-manifolds.Comment: 20 ...
Musin, Oleg R., Volovikov, Alexey Yu.
core   +3 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

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   +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