On the bandwidth of Cm×Cm
碩士 === 輔仁大學 === 數學系研究所 === 89 === The bandwidth of a graph G = (V,E), say B(G), is the minimum dilation, δ(f), among all vertex-labelings f of G (namely f is an injective integer-valued function on V ), where δ(f) = max {|f(u)－f(v)| : uv E(G)}. To determine B(G) for a graph G i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78759144397544780138 |