On (k,ℓ)-Leaf Powers
We say that, for k ≥ 2 and ℓ> k, a tree T is a (k,ℓ)-leaf root of a graph G = (V G ,E G ) if V G is the set of leaves of T, for all edges xy ∈ E G , the distance d T (x,y) in T is at most k and, for all non-edges \(xy \not\in E_G\), d T (x,y) is at least ℓ. A graph G is a (k,ℓ)-leaf power if it has a (k,ℓ)-leaf root. This new notion modifies the concept of k-leaf power which was introduced and studied by Nishimura, Ragde and Thilikos motivated by the search for underlying phylogenetic trees. Recently, a lot of work has been done on k-leaf powers and roots as well as on their variants phylogenetic roots and Steiner roots. For k = 3 and k = 4, structural characterisations and linear time recognition algorithms of k-leaf powers are known, and, recently, a polynomial time recognition of 5-leaf powers was given. For larger k, the recognition problem is open.
We give structural characterisations of (k,ℓ)-leaf powers, for some k and ℓ, which also imply an efficient recognition of these classes, and in this way we also improve and extend a recent paper by Kennedy, Lin and Yan on strictly chordal graphs and leaf powers.
Keywords(k and ℓ) -leaf powers leaf powers leaf roots strictly chordal graphs linear time algorithms
Unable to display preview. Download preview PDF.
- 1.Bibelnieks, E., Dearing, P.M.: Neighborhood subtree tolerance graphs. Discrete Applied Math. 98, 133–138 (2006)Google Scholar
- 3.Brandstädt, A., Le, V.B.: Dieter Rautenbach. Exact leaf powers, manuscript (submitted, 2006)Google Scholar
- 4.Brandstädt, A., Le Dieter, V.B.: Rautenbach, Distance-hereditary 5-leaf powers, manuscript (submitted, 2006)Google Scholar
- 5.Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications 3 (1999)Google Scholar
- 6.Brandstädt, A., Le, V.B., Sritharan, R.: Structure and linear time recognition of 4-leaf powers, manuscript (submitted, 2006)Google Scholar
- 8.Buneman, P.: A note on the metric properties of trees. J. Combin. Th. 1(B), 48–50 (1974)Google Scholar
- 9.Chang, M.-S., Ko, T.: The 3-Steiner Root Problem. In: Proceedings WG 2007. LNCS, manuscript, as extended abstract (to appear, 2007)Google Scholar
- 11.Dom, M., Guo, J., Hüffner, F., Niedermeier, R.: Error compensation in leaf root problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 363–381. Springer, Heidelberg (2004), Algorithmica 44(4), 363–381(2006)Google Scholar
- 14.Kennedy, W.: Strictly chordal graphs and phylogenetic roots, Master Thesis, University of Alberta (2005)Google Scholar
- 18.Lubiw, A.: Γ-free matrices, Master Thesis, Dept. of Combinatorics and Optimization, University of Waterloo, Canada (1982)Google Scholar
- 19.McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications 2 (1999)Google Scholar
- 23.Spinrad, J.P.: Efficient Graph Representations, Fields Institute Monographs, American Mathematical Society, Providence, Rhode Island (2003)Google Scholar