A note on minimum linear arrangement for BC graphs

DOI10.1142/S1793830918500234zbMath1383.05282arXiv1703.01149MaRDI QIDQ4634526

Xiaofang Jiang, N. Parthiban, R. Sundara Rajan, Qing-Hui Liu

Publication date: 10 April 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.01149

zbMATH Keywords

minimum linear arrangementBC graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (2)

Maximum subgraph problem for 3-regular Knödel graphs and its wirelength ⋮ Embedding algorithm of spined cube into grid structure and its wirelength computation

Cites Work

• Unnamed Item
• Unnamed Item
• On the \(t/k\)-diagnosability of BC networks
• Embeddings of circulant networks
• An optimal time algorithm for minimum linear arrangement of chord graphs
• Linear wirelength of folded hypercubes
• A note about some properties of BC graphs
• The spined cube: a new hypercube variant with smaller diameter
• The Mobius cubes
• The locally twisted cubes
• Optimal Assignments of Numbers to Vertices
• Linear layout of locally twisted cubes
• Optimal Linear Arrangement of Interval Graphs

This page was built for publication: A note on minimum linear arrangement for BC graphs