A D2CS of a graph G is a set S⊆V(G) with diam(G[S])≤2. We study the problem of counting and enumerating D2CS of a graph. First we give an explicit formula for the number of D2CS in a complete k-ary tree, Fibonacci tree, binary Fibonacci tree and the binomial tree. Next we give an algorithm for enumerating and counting D2CS of a graph. We then give a linear time algorithm for finding all maximal D2CS in a strongly chordal graph.
@article{arxiv.1011.4550,
title = {Algorithms for enumerating and counting D2CS of some graphs},
author = {P. Venkata Subba Reddy and K. Viswanathan Iyer},
journal= {arXiv preprint arXiv:1011.4550},
year = {2010}
}
Comments
Six pages: Accepted for 15th annual conference of Gwalior academy of mathematical sciences,Dec.12-14, 2010,New Delhi