跳到主要內容

臺灣博碩士論文加值系統

(35.153.100.128) 您好!臺灣時間:2022/01/19 03:15
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:李宗儒
研究生(外文):Chung-Ru Lee
論文名稱:圖形上的帶寬問題
論文名稱(外文):The Bandwidth Problem on Graphs
指導教授:張鎮華張鎮華引用關係
指導教授(外文):Gerard J. Chang
學位類別:碩士
校院名稱:國立交通大學
系所名稱:應用數學系
學門:數學及統計學門
學類:數學學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:英文
論文頁數:11
中文關鍵詞:圖形帶寬增殖圖
外文關鍵詞:graphbandwidthmultiplication
相關次數:
  • 被引用被引用:0
  • 點閱點閱:135
  • 評分評分:
  • 下載下載:11
  • 收藏至我的研究室書目清單書目收藏:0
本篇論文所探討的是增殖圖上的帶寬問題。 更詳細來說, 我們解決了有某些條件的常數增殖圖上的帶寬問題, 及提供一些增殖路徑圖的答案

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.

Abstract ( in Chinese ) i
Abstract ( in English ) ii
Contents iii
1.Introduction 1
2.Bandwidths of constant multiplications of graphs 3
3.Bandwidths of multiplications of paths 6
Reference 12

[1] P. Z. Chin, J.
Chva'talova', A. K. Dewdney and N. E. Gibbs,
The bandwidth problem for graphs and matrices--a survey,
J. Graph Theory 6 (1982) 223--254.
[2] P. Z. Chinn, Y. Lin and J. Yuan, The bandwidth of the
corona of two graphs, Cong. Numer. 91 (1992) 141--152.
[3] P. Z. Chinn, Y. Lin, J. Yuan and K. Williams,
Bandwidth of the composition of certain graphs powers, Ars
Combin. 39 (1994) 167--173.
[4] J. Chva'talova', Optimal labeling
of a product of two graphs, Discrete Math. 11 (1975)
249--253.
[5] J. Chva'talova', On the bandwidth
problem for graphs, Ph.D. Thesis, Dept Combin Opt. Univ.
Waterloo (1980).
[6] M. R. Garey, R. L. Graham, D. S. Johnson and D. E. Knuth,
Complexity results for bandwidth minimization, SIAM J.
Appl. Math. 34 (1978) 477--495.
[7] L. H. Harper, Optimal numberings and isoperimetric
problems on graphs, J. Combin. Theory 1 (1966) 385--393.
[8] Y. L. Lai, J. Liu and K. Williams, Bandwidth for the
sum of k graphs, Ars Combin. 37 (1994) 149--155.
[9] Y. L. Lai and K. Williams, Bandwidth of the strong
product of paths and cycles, Cong. Numer. 109 (1995)
123--128.
[10] Y. L. Lai and K. Williams, A survey of solved problems
and applications on bandwidth, edgesum, and profile of graphs,
J. Graph Theory 31 (1999) 75--94
[11] J. Liu and K. Williams, On bandwidth and edgesum
for the composition of two graphs, Discrete Math. 143
(1995), no. 1-3, 159--166.
[12] J. Liu, J. Wang and K. Williams, Bandwidth for the sum
of two graphs, Cong. Numer. 82 (1991) 79--85.
[13] C. H. Papadimitriou, The NP-completeness of the bandwidth
minimization problem, Computing 16 (1976) 263--270.
[14] K. Williams, On bandwidth for the tensor product of
paths with complete bipartite graphs, Cong. Numer. 102 (1994) 183--190.
[15] J. H. Yan, The bandwidth problem in cographs, Tamsui Oxf. J. Math. Sci. 13 (1997) 31--36

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top