The generalized bandwidth sum of graphs
| Autor: | Ya-Jane Wang, 王雅真 |
|---|---|
| Rok vydání: | 2004 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 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 sum of G with respect to f. The purpose of this thesis is to study the (k, p)-bandwidth sum problem. We sdudy some basic properties and the relation between the bandwidth sum and the (k, p)-bandwidth sum, and the (k, p)-bandwidth sum of paths and cycles and bandwidth sum of the power of paths and cycles. We also consider the (2, p)-bandwidth sum of the Cartesian product of two paths, the n-cube, and the join of k graphs in this thesis. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|