International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 84 - Issue 1 |
Published: December 2013 |
Authors: Shreedevi V. Shindhe, Ishwar. B, Marriswamy. R |
![]() |
Shreedevi V. Shindhe, Ishwar. B, Marriswamy. R . Generating the Vertex Sets with some Distance Parameter Properties in Caterpillar Graphs. International Journal of Computer Applications. 84, 1 (December 2013), 6-8. DOI=10.5120/14538-2613
@article{ 10.5120/14538-2613, author = { Shreedevi V. Shindhe,Ishwar. B,Marriswamy. R }, title = { Generating the Vertex Sets with some Distance Parameter Properties in Caterpillar Graphs }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 84 }, number = { 1 }, pages = { 6-8 }, doi = { 10.5120/14538-2613 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A Shreedevi V. Shindhe %A Ishwar. B %A Marriswamy. R %T Generating the Vertex Sets with some Distance Parameter Properties in Caterpillar Graphs%T %J International Journal of Computer Applications %V 84 %N 1 %P 6-8 %R 10.5120/14538-2613 %I Foundation of Computer Science (FCS), NY, USA
In this paper the vertices of caterpillar tree T are viewed with different approach and categorized into the sets D, R and X, based on the distance parameters i. e. , diameter and radius. The distance parameters have been presented with some set theory views. Here D is the set of diametral vertices, R is the set of central vertices and X is the set of vertices which are neither central nor peripheral. Then, |D|+|R|+|X|=n. The cardinality of these sets has some property and helps to specify the basic characters of caterpillar tree. A linear complexity algorithm is also designed to generate these sets.