arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.4471math.COcs.DM
收藏

线图的盒性

Boxicity of Line Graphs

L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan

摘要:

图H的盒性,记为box(H),是指最小整数k使得H是R^k中轴平行的k维盒的交图。本文证明了对多重图的线图G,box(G)<= 2Δ(\lceil log_2(log_2(Δ))\rceil + 3)+ 1,其中Δ表示G的最大度.当Δ<= 2(χ- 1)时,对任意色数为χ的线图G,box(G)= O(χlog_2(log_2(χ).对于d维超立方体H_d,我们证明了box(H_d)>=(\lceil log_2(log_2(d))\rceil + 1)/2.寻找盒(H_d)的一个非平凡下界的问题,在[L.苏尼尔·穆兰和纳文·西瓦达桑超立方体图的立方性。离散数学,308(23):5795-5800,2008]。上述结果是我们得到的完全细分图(一个图,可以通过细分一个图的每一个边缘正好一次)的盒性的界限的后果。

英文摘要:

Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2Δ(\lceil log_2(log_2(Δ)) \rceil + 3) + 1, where Δdenotes the maximum degree of G. Since Δ<= 2(χ- 1), for any line graph G with chromatic number χ, box(G) = O(χlog_2(log_2(χ))). For the d-dimensional hypercube H_d, we prove that box(H_d) >= (\lceil log_2(log_2(d)) \rceil + 1)/2. The question of finding a non-trivial lower bound for box(H_d) was left open by Chandran and Sivadasan in [L. Sunil Chandran and Naveen Sivadasan. The cubicity of Hypercube Graphs. Discrete Mathematics, 308(23):5795-5800, 2008]. The above results are consequences of bounds that we obtain for the boxicity of fully subdivided graphs (a graph which can be obtained by subdividing every edge of a graph exactly once).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑