A note on minimum linear arrangement for BC graphs

Xiaofang Jiang; Qinghui Liu; N. Parthiban; R. Sundara Rajan

doi:10.1142/S1793830918500234

A note on minimum linear arrangement for BC graphs

Xiaofang Jiang, Qinghui Liu, N. Parthiban, R. Sundara Rajan

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

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, Z-cubes, etc., as the subfamilies.

Original language	English
Article number	1850023
Journal	Discrete Mathematics, Algorithms and Applications
Volume	10
Issue number	2
DOIs	https://doi.org/10.1142/S1793830918500234
Publication status	Published - 1 Apr 2018

Keywords

BC graphs
Minimum linear arrangement

Access to Document

10.1142/S1793830918500234

Cite this

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), Article 1850023. https://doi.org/10.1142/S1793830918500234

@article{d35854017144407aa832d0074d7d5ad7,

title = "A note on minimum linear arrangement for BC graphs",

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, Z-cubes, etc., as the subfamilies.",

keywords = "BC graphs, Minimum linear arrangement",

author = "Xiaofang Jiang and Qinghui Liu and N. Parthiban and Rajan, {R. Sundara}",

note = "Publisher Copyright: {\textcopyright} 2018 World Scientific Publishing Company.",

year = "2018",

month = apr,

day = "1",

doi = "10.1142/S1793830918500234",

language = "English",

volume = "10",

journal = "Discrete Mathematics, Algorithms and Applications",

issn = "1793-8309",

publisher = "World Scientific",

number = "2",

}

TY - JOUR

T1 - A note on minimum linear arrangement for BC graphs

AU - Jiang, Xiaofang

AU - Liu, Qinghui

AU - Parthiban, N.

AU - Rajan, R. Sundara

PY - 2018/4/1

Y1 - 2018/4/1

N2 - 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.

AB - 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.

KW - BC graphs

KW - Minimum linear arrangement

UR - http://www.scopus.com/inward/record.url?scp=85042795431&partnerID=8YFLogxK

U2 - 10.1142/S1793830918500234

DO - 10.1142/S1793830918500234

M3 - Article

AN - SCOPUS:85042795431

SN - 1793-8309

VL - 10

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

IS - 2

M1 - 1850023

ER -

A note on minimum linear arrangement for BC graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this