The generalized bandwidth sum of graphs
碩士 === 國立東華大學 === 應用數學系 === 92 === Given a number p with 0 ≦ p ≦ 1 and a graph G with vertex set V (G). When (k, p) ≠ (1, 0), for each proper labeling f of G,we try to find the the (k, p)-bandwidth sum of G with respect to f.And the (k,p)-bandwidth sum of G is minimum of the (k, p)-bandwidth s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68844782834615399856 |