A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Let G be a (p, q) graph. Let f be an injective map from V (G) to {1, 2,..., p}. For each edge xy,
assign the label (xy) or (yx) according as x> y or y> x. f is called a parity combination cordial …

Kth Fibonacci Prime Labeling of Graphs Page 1 International Journal of Mathematics
Trends and Technology Volume 68 Issue 5, 61-67, May 2022 ISSN: 2231-5373/ https://doi.org/10.14445/22315373/IJMTT-V68I5P510 …

Parity Combination Cordial Labeling In the Context of Duplication of Graph Elements Page 1
IOSR Journal of Mathematics (IOSR-JM) e-ISSN: 2278-5728, p-ISSN: 2319-765X. Volume 15 …

Graphs we are used in this article is simple undirected without multiple edges or loops.
Graph labelling is a vast area in research. Labeled graphs are used in various scientific and …

This chapter discusses an undirected, connected, simple, finite and non-trivial graph having
a vetex set and an edge set. In graph labeling the integers are assigned to a set of vertices …

KP Shah Department of Mathematics, Gujarat University, Ahmedabad, Gujarat (INDIA) E-
mail: kinjal. shah09@ yahoo. com f For a graph G (V, E), a bijective function ƒ: V→{1, 2 …

Let G be a graph with finite vertices p, finite edges q. An injective function is called a
combination labelling if such that each edge has the label (xy) or (yx) according as x≤ y …