圖形上的帶寬問題

標題:	圖形上的帶寬問題 The Bandwidth Problem on Graphs
作者:	李宗儒 Chung-Ru Lee 張鎮華 Gerard J. Chang 應用數學系所
關鍵字:	圖形;帶寬;增殖圖;graph;bandwidth;multiplication
公開日期:	2001
摘要:	本篇論文所探討的是增殖圖上的帶寬問題。更詳細來說，我們解決了有某些條件的常數增殖圖上的帶寬問題，及提供一些增殖路徑圖的答案 This thesis investigates the bandwidth problem for multiplications of graphs. In particular, we solve the bandwidth problem for constant multiplications of graphs with certain conditions. We also give solution to some multiplications of paths.
URI:	http://140.113.39.130/cdrfb3/record/nctu/#NT900507020 http://hdl.handle.net/11536/69316
Appears in Collections:	Thesis