For an undirected graph G the k-th power Gk of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in G. In this paper we consider LexBFS-orderings of chordal, distance-hereditary and HHD-free graphs (the graphs where each cycle of length at least five has two chords) with respect to their powers. We show that any LexBFS-ordering of a chordal graph is a common perfect elimination ordering of all odd powers of this graph, and any LexBFS-ordering of a distance-hereditary graph is a common perfect elimination ordering of all its even powers. It is well-known that any LexBFS-ordering of a HHD-free graph is a so-called semi-simplicial ordering. We show, that any LexBFS-ordering of a HHD-free graph is a common semi-simplicial ordering of all its odd powers. Moreover we characterize those chordal, distance-hereditary and HHD-free graphs by forbidden isometric subgraphs for which any LexBFS-ordering of the graph is a common perfect elimination ordering of all its nontrivial powers. As an application we get a linear time approximation of the diameter for weak bipolarizable graphs, a subclass of HHD-free graphs containing all chordal graphs, and an algorithm which computes the diameter and a diametral pair of vertices of a distance-hereditary graph in linear time.
CITATION STYLE
Dragan, F. F., Nicolai, F., & Brandstädt, A. (1997). LexBFS-orderings and powers of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1197 LNCS, pp. 166–180). https://doi.org/10.1007/3-540-62559-3_15
Mendeley helps you to discover research relevant for your work.