The bandwidth sum of join and composition of graphs
type: Item
instance of: scholarly article
title: The bandwidth sum of join and composition of graphs
zbMATH Open document ID: 1064.05132
author: Xianqiang Yang
published in: Discrete Mathematics
publication date: 2005-04-18T00:00:00Z
review text: First of all the authors shortly describe the history of the bandwidth sum problem. Then they give an exact result for the bandwidth sum problem for the join of \(k\) graphs \(G_1,G_2,\dots, G_k\), where each \(G_i\) is a path, cycle, complete graph or union of isolated vertices. Then they give a similar result for the bandwidth sum of the composition of two graphs and some other results.
reviewed by: Ferdinand Gliviak
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 2157728
MaRDI profile type: Publication
full work available at URL: j.disc.2004.10.008
OpenAlex ID: W1981697815
cites work: On optimal linear arrangements of trees
cites work: Some simplified NP-complete graph problems
cites work: Optimal Assignments of Numbers to Vertices
cites work: Q4862908
cites work: Q4390639
cites work: On bandwidth and edgesum for the composition of two graphs
cites work: Q3139716
DOI: 10.1016/J.DISC.2004.10.008
description: scientific article; zbMATH DE number 2157728