论文信息 - Hereditary dominating pair graphs

Hereditary dominating pair graphs

An asteroidal triple (AT) is a set of vertices such that each pair of vertices is joined by a path that avoids the neighborhood of the third. Every AT-free graph contains a dominating pair, a pair of vertices such that for every path between them, every vertex of the graph is within distance one of the path. We say that a graph is a hereditary dominating pair (HDP) graph if each of its connected induced subgraphs contains a dominating pair. In this paper we introduce the notion of frame HDP graphs in order to capture the structure of HDP graphs that contain asteroidal triples. We also determine the maximum diameter of frame HDP graphs.

[1] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[2] Stephan Olariu,et al. Asteroidal Triple-Free Graphs , 1993, SIAM J. Discret. Math..

[3] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[4] T. Gallai. Transitiv orientierbare Graphen , 1967 .

[5] D. West. Introduction to Graph Theory , 1995 .

[6] Stephan Olariu,et al. Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs , 1995, SIAM J. Comput..

[7] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .

[8] Jitender S. Deogun,et al. Dominating Pair Graphs , 2002, SIAM J. Discret. Math..

[9] Natasa Przulj. Minimal hereditary dominating pair graphs , 2000 .