On bandwidth sums of graphs

DOI10.1007/BF02012624MaRDI QIDQ1898897zbMATH OpenFDO

Authors Bing Yao, Jianfang Wang

Publication date 11 March 1996

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02012624

zbMATH Keywords

bandwidth bandwidth sum bounds diameter independent number maximum degree order size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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\).

Recommendations

Cites work

Cited in

(27)

This page was built for publication: On bandwidth sums of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898897)