Boxicity of Leaf Powers
 L. Sunil Chandran,
 Mathew C. Francis,
 Rogers Mathew
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The boxicity of a graph G, denoted as boxi(G), is defined as the minimum integer t such that G is an intersection graph of axisparallel tdimensional boxes. A graph G is a kleaf power if there exists a tree T such that the leaves of the tree correspond to the vertices of G and two vertices in G are adjacent if and only if their corresponding leaves in T are at a distance of at most k. Leaf powers are used in the construction of phylogenetic trees in evolutionary biology and have been studied in many recent papers. We show that for a kleaf power G, boxi(G) ≤ k−1. We also show the tightness of this bound by constructing a kleaf power with boxicity equal to k−1. This result implies that there exist strongly chordal graphs with arbitrarily high boxicity which is somewhat counterintuitive.
 Bhowmick, D., Sunil Chandran, L.: Boxicity of circular arc graphs. Preprint (2008)
 Bohra, A., Sunil Chandran, L., Krishnam Raju, J. (2006) Boxicity of series parallel graphs. Discret. Math. 306: pp. 22192221 CrossRef
 Brandstädt, A., Bang Le, V. (2006) Structure and linear time recognition of 3leaf powers. Inf. Process. Lett. 98: pp. 133138 CrossRef
 Brandstädt, A., Bang Le, V., Sritharan, R. (2008) Structure and lineartime recognition of 4leaf powers. ACM Trans. Algorithm. 5: pp. 122 CrossRef
 Brandstädt, A., Wagner, P.: On (k, l)leaf powers. In: Kucera, L., Kucera, A. (eds.), Mathematical Foundations of Computer Science 2007 (2007)
 Chandran, L.S., Francis, M.C., Sivadasan, N. (2008) Boxicity and maximum degree. J. Comb. Theory Ser. B 98: pp. 443445 CrossRef
 Chandran, L.S., Francis, M.C., Sivadasan, N.: Geometric representation of graphs in low dimension using axis parallel boxes. Algorithmica 56(2), 2010
 Chandran, L.S., Francis, M.C., Suresh, S. (2009) Boxicity of Halin graphs. Discret. Math. 309: pp. 32333237 CrossRef
 Chandran, L.S., Sivadasan, N. (2007) Boxicity and treewidth. J. Comb. Theory Ser. B 97: pp. 733744 CrossRef
 Cozzens, M.B., Roberts, F.S. (1983) Computing the boxicity of a graph by covering its complement by cointerval graphs. Discret. Appl. Math. 6: pp. 217228 CrossRef
 Dahlhaus, E., Duchet, P. (1987) On strongly chordal graphs. Ars Comb. 24B: pp. 2330
 Dahlhaus, E., Manuel, P.D., Miller, M. (1998) A characterization of strongly chordal graphs. Discret. Math. 187: pp. 269271 CrossRef
 Dom, M., Guo, J., Hüffner, F., Niedermeier, R. (2008) Closest 4leaf power is fixedparameter tractable. Discret. Appl. Math. 156: pp. 33453361 CrossRef
 Farber, M. (1983) Characterizations of strongly chordal graphs. Discret. Math. 43: pp. 173189 CrossRef
 Kennedy, W., Lin, G., Yan, G. (2006) Strictly chordal graphs are leaf powers. J. Discret. Algorithms 4: pp. 511525 CrossRef
 Lekkerkerker, C.G., Boland, J.C. (1962) Representation of a finite graph by a set of intervals on the real line. Fundam. Math. 51: pp. 4564
 Lubiw, A.: Γfree matrices. Master’s thesis, Princeton University (1982)
 McKee, T.A. (2000) Strong clique trees, neighborhood trees, and strongly chordal graphs. J. Graph Theory 33: pp. 151160 CrossRef
 McKee, T.A. (2003) Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs. Discret. Math. 260: pp. 231238 CrossRef
 Nishimura, N., Ragde, P., Thilikos, D.M. (2002) On graph powers for leaflabeled trees. J. Algorithms 42: pp. 69108 CrossRef
 Raychaudhuri, A. (1992) On powers of strongly chordal and circular graphs. Ars Comb. 34: pp. 147160
 Roberts, F.S.: On the boxicity and cubicity of a graph. In: Recent Progresses in Combinatorics, pp. 301–310. Academic Press, New York (1969)
 Scheinerman, E.R.: Intersection Classes and Multiple Intersection Parameters. PhD thesis, Princeton University (1984)
 Thomassen, C. (1986) Interval representations of planar graphs. J. Comb. Theory Ser. B 40: pp. 920 CrossRef
 Title
 Boxicity of Leaf Powers
 Journal

Graphs and Combinatorics
Volume 27, Issue 1 , pp 6172
 Cover Date
 20110101
 DOI
 10.1007/s0037301009625
 Print ISSN
 09110119
 Online ISSN
 14355914
 Publisher
 Springer Japan
 Additional Links
 Topics
 Keywords

 Boxicity
 Leaf powers
 Tree powers
 Strongly chordal graphs
 Interval graphs
 Industry Sectors
 Authors

 L. Sunil Chandran ^{(1)}
 Mathew C. Francis ^{(1)}
 Rogers Mathew ^{(1)}
 Author Affiliations

 1. Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560012, India