Back to Search
Start Over
A note on minimum linear arrangement for BC graphs.
- Source :
-
Discrete Mathematics, Algorithms & Applications . Apr2018, Vol. 10 Issue 2, p-1. 7p. - Publication Year :
- 2018
-
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, -cubes, etc., as the subfamilies. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LINEAR algebra
*GRAPHIC methods
*NUMBER systems
*CUBES
*GEOMETRIC vertices
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 10
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 128826752
- Full Text :
- https://doi.org/10.1142/S1793830918500234