Results 21 to 30 of about 612,378 (298)
Prime Cordial Labeling On Graphs
, 2013 A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if gcd(f(u), f(v)) > 1, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.
S. Babitha, J. Baskar Babujee
openaire +3 more sources
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
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
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
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
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
SCOOTER: A compact and scalable dynamic labeling scheme for XML updates [PDF]
, 2012 Although dynamic labeling schemes for XML have been the focus of recent research activity, there are significant challenges still to be overcome. In particular, though there are labeling schemes that ensure a compact label representation when creating ...
O\u27Connor, Martin F. +4 more
core +2 more sources
Consecutive Prime and Highly Total Prime Labeling in Graphs [PDF]
, 2020 This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total prime labeling. These are variations on prime labeling, introduced by Tout, Dabboucy, and Howalla in 1982.
Scholle, Robert
core +1 more source