On the complexity of finding a sun in a graph

Details On the complexity of finding a sun in a graph On the complexity of finding a sun in a graph

2008-07-03

arxiv.org/abs/0807.0462v1

Computer Science

Discrete Mathematics

Scientific paper

The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain an induced cycle of length at least four. A graph is strongly chordal if it is chordal and every even cycle has a chord joining vertices whose distance on the cycle is odd. Farber proved that a graph is strongly chordal if and only if it is chordal and contains no induced suns. There are well known polynomial-time algorithms for recognizing a sun in a chordal graph. Recently, polynomial-time algorithms for finding a sun for a larger class of graphs, the so-called HHD-free graphs, have been discovered. In this paper, we prove the problem of deciding whether an arbitrary graph contains a sun in NP-complete.

Affiliated with

Also associated with

No associations

Rating

On the complexity of finding a sun in a graph 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 On the complexity of finding a sun in a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of finding a sun in a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115075