A note on minimum linear arrangement for BC graphs
Discrete Mathematics
2017-03-06 v1
Abstract
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\"{o}bius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, -cubes, etc. as the subfamilies.
Cite
@article{arxiv.1703.01149,
title = {A note on minimum linear arrangement for BC graphs},
author = {Xiaofang Jiang and Qinghui Liu and Natarajan Parthiban and R. Sundara Rajan},
journal= {arXiv preprint arXiv:1703.01149},
year = {2017}
}
Comments
6 pages