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

Abstract

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 . In this paper we prove that some classes of graphs related to H- super subdivision of Y -tree are prime graphs.

Keywords

• prime labeling, y - tree, h- graph, h-super subdivision graph, prime graph.