Algorithms for enumerating and counting D2CS of some graphs
arXiv:1011.4550
Abstract
A D2CS of a graph G is a set with . 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.
Six pages: Accepted for 15th annual conference of Gwalior academy of mathematical sciences,Dec.12-14, 2010,New Delhi