DISTANCE IN SPLITTING AND COSPLITTING GRAPHS
Journal: International Journal OF Engineering Sciences & Management Research (Vol.2, No. 12)Publication Date: 2015-12-30
Authors : Selvam Avadayappan; M. Bhuvaneshwari; S.Rajeev Gandhi;
Page : 50-54
Keywords : : Splitting graphs; cosplitting graphs; distance; radius; diameter; self centered graph.;
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.
Other Latest Articles
- MODEL FORMULATION OF TRAFFIC NOISE AT EXPRESS HIGHWAY
- DESIGN OF FLAT BOTTOM CIRCULAR TANK USING C++ PROGRAMME
- STATE OF ART OF USAGE OF ALTERNATIVE MATERIALS IN CONCRETE
- A CASE STUDY TO RENDER COMPUTER GRAPHICS IN 3-D USING INTEGRAL PHOTOGRAPHY (IP) AND IMAGING
- A FRAMEWORK FOR THE ANALYSIS OF SUPPLY CHAIN RISK MANAGEMENT IN SMALL SCALE BUSINESS ENTERPRISE
Last modified: 2015-11-29 19:16:08