A note on minimum linear arrangement for BC graphs
2018 ◽
Vol 10
(02)
◽
pp. 1850023
Keyword(s):
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, [Formula: see text]-cubes, etc., as the subfamilies.
1995 ◽
Vol 59
(2)
◽
pp. 137-151
◽
1982 ◽
Vol 3
(1)
◽
pp. 99-113
◽
Keyword(s):
2016 ◽
Vol 8
(2)
◽
pp. 1-12
◽
2000 ◽
Vol 103
(1-3)
◽
pp. 127-139
◽
2001 ◽
Vol 30
(6)
◽
pp. 1773-1789
◽
2011 ◽
Vol 24
(4)
◽
pp. 540-563
◽
2016 ◽
Vol 26
(1)
◽
pp. 3-16
◽