A note on minimum linear arrangement for BC graphs-Reference-Cited by-同舟云学术

A note on minimum linear arrangement for BC graphs

Published:2018-04 Issue:02 Volume:10 Page:1850023
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Jiang Xiaofang¹,Liu Qinghui¹,Parthiban N.²³,Rajan R. Sundara⁴

Affiliation:

1. Department of Computer Science, Beijing Institute of Technology, Beijing, P. R. China

2. School of Advanced Sciences, Vellore Institute of Technology, Chennai 600 127, India

3. School of Computing Science and Engineering, VIT Bhopal University, Madhya Pradesh 466 114, India

4. Department of Mathematics, Hindustan Institute of Technology and Science, Chennai 603 103, India

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öbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, [Formula: see text]-cubes, etc., as the subfamilies.

Funder

National Natural Science Foundation of China

Department of Science and Technology, SERB, Government of India

National Board of Higher Mathematics

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830918500234

Reference21 articles.

1. The twisted cube topology for multiprocessors: A study in network asymmetry