Boxicity and Cubicity of product graphs
Research output: Contribution to journal › Article › Research › peer-review
Authors
Organisational units
External Organisational units
- Indian Institute of Science
- Dalhousie University
Abstract
The boxicity (cubicity) of a graph is the minimum natural number such that can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in . In this article, we give estimates on the boxicity and the cubicity of Cartesian, strong and direct products of graphs in terms of invariants of the component graphs. In particular, we study the growth, as a function of , of the boxicity and the cubicity of the th power of a graph with respect to the three products. Among others, we show a surprising result that the boxicity and the cubicity of the th Cartesian power of any given finite graph is, respectively, in and . On the other hand, we show that there cannot exist any sublinear bound on the growth of the boxicity of powers of a general graph with respect to strong and direct products.
Details
Original language | English |
---|---|
Pages (from-to) | 100 - 109 |
Number of pages | 10 |
Journal | European journal of combinatorics |
Volume | 48.2015 |
Issue number | August |
Early online date | 15 Mar 2015 |
DOIs | |
Publication status | Published - 2015 |