Bandwidth sums of block graphs and cacti

Gerard Jennhwa Chang (), Ma-Lian Chia (), David Kuo (), Ji-Yin Lin and Jing-Ho Yan ()
Additional contact information
Gerard Jennhwa Chang: National Taiwan University
Ma-Lian Chia: Aletheia University
David Kuo: National Dong Hwa University
Ji-Yin Lin: National Dong Hwa University
Jing-Ho Yan: Aletheia University

Journal of Combinatorial Optimization, 2014, vol. 27, issue 4, No 4, 679-687

Abstract: Abstract A labeling of a graph G is an injective function f:V(G)→ℤ. The bandwidth sum of a graph G with respect to a labeling f is $B_{s}^{f}(G) = \sum_{uv \in E(G)} |f(u)-f(v)|$ and the bandwidth sum of G is $B_{s}(G) = \min\{B_{s}^{f}(G)\colon f\mbox{ is a labeling of }G\}$ . In this paper, we determine bandwidth sums for some block graphs and cacti.

Keywords: Labeling; Bandwidth sum; Block graph; Cactus; Block-cut-vertex graph (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9548-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:27:y:2014:i:4:d:10.1007_s10878-012-9548-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9548-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().