#### Document Type

Article

#### Publication Date

2010

#### Department

Physics & Computer Science

#### Abstract

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 (graphs containing no house, hole, or domino), have been discovered. In this paper, we prove the problem of deciding whether an arbitrary graph contains a sun is NP-complete.

#### Recommended Citation

Hoàng, Chính T., "On the Complexity of Finding a Sun in a Graph" (2010). *Physics and Computer Science Faculty Publications*. 74.

http://scholars.wlu.ca/phys_faculty/74

## Comments

This article was originally published in

SIAM Journal on Discrete Mathematics, 23(4): 2156-2162. © 2010 Society for Industrial and Applied Mathematics