ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login


Journal: International Journal OF Engineering Sciences & Management Research (Vol.2, No. 12)

Publication Date:

Authors : ; ; ;

Page : 50-54

Keywords : : Splitting graphs; cosplitting graphs; distance; radius; diameter; self centered graph.;

Source : Downloadexternal Find it from : Google Scholarexternal


The graph S(G) obtained from a graph G(V,E), by adding a new vertex w for every vertex v to all neighbours of v in G, is called the splitting graph of G. The cosplitting graph CS(G) is obtained from G, by adding a new vertex wi for each vertex vi and joining wi¬ to all vertices of G which are not adjacent to vi in G. In this paper, we study the properties related to distance in splitting and cosplitting graphs.

Last modified: 2015-11-29 19:16:08