Skip to main content
SpringerLink
Log in

Bandwidth sums of block graphs and cacti

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Chung FRK (1978) A conjectured minimum valuation tree, problems and solutions. SIAM Rev 20:601–604

    Article  Google Scholar 

  • Chung FRK (1984) On optimal linear arrangements of trees. Comput Math Appl 10:43–60

    Article  MATH  MathSciNet  Google Scholar 

  • Garey MR, Johnson DS, Stockmeyer RL (1974) Some simplified NP-complete problems. In: Proc 6th annual ACM symp on theory of computing, pp 47–63

    Google Scholar 

  • Harper LH (1964) Optimal assignment of numbers to vertices. J SIAM 12:131–135

    MATH  MathSciNet  Google Scholar 

  • Lai Y-L, Williams K (1993) The edgesum of the sum of k sum deterministic graphs. Congr Numer 102:231–236

    MathSciNet  Google Scholar 

  • Williams K (1992) Determining bandwidth sum for certain graph sums. Congr Numer 90:77–86

    MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank the referee for many useful suggestions.

Author information

Authors and Affiliations

  1. Department of Mathematics, National Taiwan University, Taipei, 10617, Taiwan

    Gerard Jennhwa Chang

  2. Taida Institute for Mathematical Sciences, National Taiwan University, Taipei, 10617, Taiwan

    Gerard Jennhwa Chang

  3. Taipei Office, National Center for Theoretical Sciences, Taipei, Taiwan

    Gerard Jennhwa Chang

  4. Department of Applied Mathematics, Aletheia University, Tamsui, 251, Taiwan

    Ma-Lian Chia & Jing-Ho Yan

  5. Department of Applied Mathematics, National Dong Hwa University, Hualien, 97401, Taiwan

    David Kuo & Ji-Yin Lin

Authors
  1. Gerard Jennhwa Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ma-Lian Chia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ji-Yin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jing-Ho Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ma-Lian Chia.

Additional information

G.J. Chang is supported in part by the National Science Council under grant NSC98-2115-M-002-013-MY3. M.-L. Chia is supported in part by the National Science Council under grants NSC97-2115-M-156-004-MY2. D. Kuo is supported in part by the National Science Council under grants NSC94-2115-M-259-004. J.-H. Yan is supported in part by the National Science Council under grants NSC94-2115-M-156-001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, G.J., Chia, ML., Kuo, D. et al. Bandwidth sums of block graphs and cacti. J Comb Optim 27, 679–687 (2014). https://doi.org/10.1007/s10878-012-9548-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9548-x

Keywords

Search

Navigation