Super Lehmer - 3 Mean Labeling of Path Union Related Graphs

Abstract

Let  be an injective function. For a vertex labeling  the induced edge labeling  is defined by  or , then  is called Super Lehmer -3 mean labeling, if . A graph which admits Super Lehmer – 3 Mean Labeling is called Super Lehmer – 3 Mean graphs. In this paper, we prove that path union related graphs such as path union of two cycle, path union of three cycle,  path union of two cycle with path , path union of two crown, path union of three crown and  path union of two crown with path  are all super lehmer – 3 mean graph.