DISTANCE IN SPLITTING AND COSPLITTING GRAPHS

Authors

  • Selvam Avadayappan, M. Bhuvaneshwari, S.Rajeev Gandhi Author

Keywords:

Splitting graphs, cosplitting graphs, distance, radius, diameter, self centered graph. AMS Subject Classification Code(2000): 05C (Primary)

Abstract

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.

Downloads

Published

2015-12-30

Issue

Vol. 2 No. 12 (2015): December-2015

Section

Articles

How to Cite

DISTANCE IN SPLITTING AND COSPLITTING GRAPHS. (2015). International Journal of Engineering Sciences & Management Research, 2(12), 50-54. https://ijesmr.com/index.php/ijesmr/article/view/157