1Velammal College of Engineering and Technology, Madurai, India
2Research Scholar, Department of Mathematics, Anna University, Chennai, India
Online published on 8 May, 2017.
The central graph of a graph G is denoted as C(G) and is obtained from G by subdividing each edge of G exactly once and joining all other non adjacent vertices of G. In this paper, we prove that for any connected graph G, Y (C(G)≤p-1 and for any tree T, Y(C(T)≤p-l wherel is the number of pendant vertices of G and we characterise Connected Unicyclic graphs for which Y(C(G)=p-1.
Bondage number, Central graph, Domination number, Trees, Connected Unicyclic graphs, Bistar, Lobster, Line graph
