摘要
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. in this paper, we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, Z-cubes, etc., as the subfamilies.
源语言 | 英语 |
---|---|
文章编号 | 1850023 |
期刊 | Discrete Mathematics, Algorithms and Applications |
卷 | 10 |
期 | 2 |
DOI | |
出版状态 | 已出版 - 1 4月 2018 |
指纹
探究 'A note on minimum linear arrangement for BC graphs' 的科研主题。它们共同构成独一无二的指纹。引用此
Jiang, X., Liu, Q., Parthiban, N., & Rajan, R. S. (2018). A note on minimum linear arrangement for BC graphs. Discrete Mathematics, Algorithms and Applications, 10(2), 文章 1850023. https://doi.org/10.1142/S1793830918500234