PRIME LABELING FOR SOME LADDER RELATED GRAPHS

摘要

A graph with vertex set V is said to have a prime labeling if its vertices are labeled with distinct integers 1, 2, 3 ... |V| such that for edge xy the labels assigned to x and y are relatively prime. A graph which admits prime labeling is called a prime graph. In this paper we investigate prime labeling for some ladder related graphs. We also discuss prime labeling in the context of some graph operations namely fusion and duplication in ladder L_n.