On bandwidth sums of graphs
type: Item
instance of: scholarly article
title: On bandwidth sums of graphs
zbMATH Open document ID: 0833.05068
DOI: 10.1007/BF02012624
author: Bing Yao
author: Jianfang Wang
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1996-03-11T00:00:00Z
review text: The two authors deal with the bandwidth sum problem of graphs \(G\). After having proved two monotonicity properties of the bandwidth sum \(B_{\text{sum}}(G)\) and computed \(B_{\text{sum}}(G)\) of the star \(G= K_{1, n}\), \(n\geq 2\), Yao and Wang determine lower and upper bounds for \(B_{\text{sum}}(G)\) depending on the order \(p(G)\), size \(q(G)\), diameter \(D(G)\), independent number \(\alpha(G)\), maximum degree \(\Delta(G)\) or bandwidth \(B(G)\) of \(G\).
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 800637
zbMATH Keywords: bandwidth sum
zbMATH Keywords: bounds
zbMATH Keywords: order
zbMATH Keywords: size
zbMATH Keywords: diameter
zbMATH Keywords: independent number
zbMATH Keywords: maximum degree
zbMATH Keywords: bandwidth
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: Q3097395
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Q4198056
cites work: Optimal Assignments of Numbers to Vertices
Recommended article: Q4305531
Recommended article: Q3836928
Recommended article: Q3328586
Recommended article: Q3139716
Recommended article: Bandwidth sums of block graphs and cacti
Recommended article: Q4848769
Recommended article: The bandwidth sum of join and composition of graphs
Recommended article: Q4232817
Recommended article: Bounding the bandwidths for graphs
Recommended article: Q4028466
description: scientific article; zbMATH DE number 800637