The bandwidth sum of some classes of graphs
碩士 === 國立東華大學 === 應用數學系 === 88 === Given a graph G , a proper labeling f of G is an one-to-one function. The bandwidth sum of a graph G , denoted by B_s is defined byB_s=min{sum_{uv in E(G)}|f(u)-f(v)|} , where the minimum is taken for all proper labeling f of G . In this thesis, we s...
Main Authors: | Mmei-Ju Chen, 陳美如 |
---|---|
Other Authors: | David Kuo |
Format: | Others |
Language: | en_US |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/37586819605984683233 |
Similar Items
-
Bandwidth sum of corona of graphs
by: Yu-Jing Huang, et al.
Published: (2009) -
The generalized bandwidth sum of graphs
by: Ya-Jane Wang, et al.
Published: (2004) -
The bandwidth sum of block graphs
by: Chih-Ying Lin, et al.
Published: (2005) -
The Bandwidth and Generalized Bandwidth of Graphs
by: Mei-Chu huang, et al.
Published: (2004) -
A Study on Cyclic Bandwidth Sum
by: Ying-Da Chen, et al.
Published: (2004)