Fibonacci range labeling on direct product of path and cycles graphs

Abstract

The primary concept of direct product constitute from the idea of product graphs establish from Weichsel [13], where the direct product of two graphs is connected if and only if both are connected and are not bipartite. From Imrich and Klavzar [6], the direct product G×H of graphs G and H is the graph with the vertex set V (G) × V (H) and for which vertices (x, y) and (x’, y’) being adjacent in G×H ⇐⇒ xx’∈ E(H) and yy’∈E(G). Here, we characterize for direct product of graphs and prove on certain class of direct product of path and cycles graphs with Fibonacci range labeling.