博碩士論文 104221021 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:176 、訪客IP:54.210.158.163
姓名 林育丞(Yu-Cheng Lin)  查詢紙本館藏   畢業系所 數學系
論文名稱 d 維立方體圖上有效電阻與首達時間的計算方法
(On the computation of effective resistances and first hitting time in a d-cube)
相關論文
★ 圓環面網路上的病毒散播★ 以2D HP 模型對蛋白質摺疊問題之研究
★ On Steiner centers of graphs★ On the Steiner medians of a block graph
★ 圖形列表著色★ 秩為5的圖形
★ Some results on distance-two labeling of a graph★ 關於非奇異線圖的樹
★ On Minimum Strictly Fundamental Cycle Basis★ 目標集選擇問題
★ 路徑圖與格子圖上的目標集問題★ 超立方體圖與格子圖上的目標集問題
★ 圖形環著色數的若干等價定義★ 網格圖上有效電阻計算方法的比較
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   至系統瀏覽論文 (2023-8-1以後開放)
摘要(中) 在這份報告中,我們整理了學界已發表的論文中,用來計算 d 維立方體圖中兩點間有效電阻與首達時間的一些方法。
摘要(英) In this report, we present several known methods in the literature which determine the first hitting time and resistance distances between two nodes in a d-dimensional hypercube (d-cube).
關鍵字(中) ★ 圖論
★ 首達時間
關鍵字(英) ★ Graph Theory
★ Hitting Time
論文目次 1 Introduction and preliminaries 1
2 Hitting time H(i, j) for two vertices i, j in a d-cube 4
3 Effective resistance Reff(i, j) between a pair of antipodal vertices i and j in a d-cube 10
References 15
參考文獻 [1] Titu Andreescu and Răzvan Gelca, Mathematical Olympiad challenges, Birkhäuser, 2000.
[2] Béla Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, vol. 184, Springer, 1998.
[3] P. Doyle and J. Snell, Random walks and electric networks, The Mathematical Association of
America, vol. 22, 1987.
[4] L. Lovász, Random walks on graphs: a survey, in combinatorics, Paul Erdös is eighty, Bolyai
Soc. Math. Stud. 2 (1993) 1-46.
[5] Daniel A. Spielman, Course Notes for Spectral Graph Theory - Lecture 5, Fall 2014, Yale University,
USA.
[6] Daniel A. Spielman, Course Notes for Spectral Graph Theory - Lectures 7 and 8, Fall 2015, Yale
University, USA.
[7] P. Tetali, Random walks and the effective resistance of networks, J. Theoret. Probab. 4 (1991)
101-109.
[8] O. J. Tretiak and T. S. Huang, Resistance of an n-dimensional cube, Proceedings of the IEEE,
Volume: 53, Issue: 9 (1965) 1271-1272
[9] Hong-Gwa Yeh, Class Notes for Graph Structure Theory, Fall 2016, National Central University,
Taiwan.
指導教授 葉鴻國(Hong-Gwa Yeh) 審核日期 2018-6-27
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明