New Results on Labelings of Central Graph of Barbell Graph

Abstract

Abstract.A Barbell graph B(p, n) is the graph obtained by connecting n-copies of a complete graph K p by a bridge. A central graph of Barbell graph C(B(p, n)) is the graph obtained by subdividing each edge of B(p, n) exactly once and joining all the non adjacent vertices of B(p, n). In this paper, the ways to construct root mean square, square sum, square difference, cordial, total cordial labelings of central graph of Barbell graphs are reported.