Asteroids in rooted and directed path graphs

Details Asteroids in rooted and directed path graphs Asteroids in rooted and directed path graphs

2008-12-15

arxiv.org/abs/0812.2734v2

Computer Science

Discrete Mathematics

Scientific paper

An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classical characterization of interval graphs by Lekkerkerker and Boland. Their result says that a chordal graph is an interval graph if and only if it contains no asteroidal triple. In this paper, we prove an analogous theorem for directed path graphs which are the intersection graphs of directed paths in a directed tree. For this purpose, we introduce the notion of a strong path. Two non-adjacent vertices are linked by a strong path if either they have a common neighbor or they are the endpoints of two vertex-disjoint chordless paths satisfying certain conditions. A strong asteroidal triple is an asteroidal triple such that each pair is linked by a strong path. We prove that a chordal graph is a directed path graph if and only if it contains no strong asteroidal triple. We also introduce a related notion of asteroidal quadruple, and conjecture a characterization of rooted path graphs which are the intersection graphs of directed paths in a rooted tree.

Affiliated with

Also associated with

No associations

Rating

Asteroids in rooted and directed path 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 Asteroids in rooted and directed path graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asteroids in rooted and directed path graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-348715