Top

Journal of Combinatorial Optimization

Published in:

01-05-2014

Bandwidth sums of block graphs and cacti

Authors: Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo, Ji-Yin Lin, Jing-Ho Yan

Published in: Journal of Combinatorial Optimization | Issue 4/2014

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

previous article A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design

next article Paired versus double domination in K 1,r -free graphs

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

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

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

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

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

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

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

Title: Bandwidth sums of block graphs and cacti
Authors: Gerard Jennhwa Chang
Ma-Lian Chia
David Kuo
Ji-Yin Lin
Jing-Ho Yan
Publication date: 01-05-2014
Publisher: Springer US
Published in: Journal of Combinatorial Optimization / Issue 4/2014
Print ISSN: 1382-6905
Electronic ISSN: 1573-2886
DOI: https://doi.org/10.1007/s10878-012-9548-x

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Other articles of this Issue 4/2014

Solving the Multidimensional Assignment Problem by a Cross-Entropy method

The cost of selfishness for maximizing the minimum load on uniformly related machines

Linear time-dependent constraints programming with MSVL

Multiple L(j,1)-labeling of the triangular lattice

Hardness results and approximation algorithm for total liar’s domination in graphs

An improved algorithm for tree edit distance with applications for RNA secondary structure comparison

Premium Partner