D-centro Sets in Graphs |
Author(s): |
| A. Anto Kinsley , St. Xavier?s (Autonomous) College, Palayamkottai; P. Siva Ananthi, St. Xavier?s (Autonomous) College, Palayamkottai |
Keywords: |
| Graph, Distance, Detour Radius, Detour Eccentricities, Detour Distance, Total Detour Distance |
Abstract |
|
In this article we introduce a new concept of D-centro sets in graphs and characterize graphs with some results. Let G be a connected graph of order p ≥ 2. For any vertex x in G, we define a x-D-centro set Sx. Then x is said to be the D-centro vertex of G if the cardinality of Sx is the maximum among all Sx. The set of all D-centro vertices of G is called D-set of G and the cardinality of D-set is said to be D-centro number of G. We determine bounds for it and characterize graphs which realize these bounds. Also, we define D-centro set, self-D-centro graph and total D-distance TD(S) of a subset S of V. |
Other Details |
|
Paper ID: IJSRDV4I11035 Published in: Volume : 4, Issue : 1 Publication Date: 01/04/2016 Page(s): 976-978 |
Article Preview |
|
|
|
|
