Abstract
We introduce a new class of graphs called diametral path graphs that properly contains the class of asteroidal triple-free graphs and the class of dominating pair graphs. We characterize the trees as well as the chordal graphs that are diametral path graphs. We present an O(n3 m) algorithm deciding whether a given graph has a dominating diametral path. Finally, we study the structure of minimum connected dominating sets in diametral path graphs.
Cite
CITATION STYLE
Deogun, J. S., & Kratsch, D. (1995). Diametral path graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1017, pp. 344–357). Springer Verlag. https://doi.org/10.1007/3-540-60618-1_87
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
