Algorithms for enumerating and counting D2CS of some graphs

Details Algorithms for enumerating and counting D2CS of some graphs Algorithms for enumerating and counting D2CS of some graphs

2010-11-20

arxiv.org/abs/1011.4550v1

Computer Science

Discrete Mathematics

Six pages: Accepted for 15th annual conference of Gwalior academy of mathematical sciences,Dec.12-14, 2010,New Delhi

Scientific paper

A D2CS of a graph G is a set $S \subseteq V(G)$ with $diam(G[S]) \leq 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.

Affiliated with

Also associated with

No associations

Rating

Algorithms for enumerating and counting D2CS of some graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for enumerating and counting D2CS of some graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for enumerating and counting D2CS of some graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21600