A note on minimum linear arrangement for BC graphs

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

Research output: Contribution to journalArticlepeer-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 languageEnglish
Article number1850023
JournalDiscrete Mathematics, Algorithms and Applications
Volume10
Issue number2
DOIs
Publication statusPublished - 1 Apr 2018

Keywords

  • BC graphs
  • Minimum linear arrangement

Fingerprint

Dive into the research topics of 'A note on minimum linear arrangement for BC graphs'. Together they form a unique fingerprint.

Cite this