![]() |
以作者查詢圖書館館藏 、以作者查詢臺灣博碩士 、以作者查詢全國書目 、勘誤回報 、線上人數:47 、訪客IP:18.227.111.102
姓名 蕭景文(Jing-Wen Shiao) 查詢紙本館藏 畢業系所 數學系 論文名稱 秩為5的圖形
(On the Graphs of Rank Five)相關論文 檔案 [Endnote RIS 格式]
[Bibtex 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
[下載]
- 本電子論文使用權限為同意立即開放。
- 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
- 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
摘要(中) 圖G 的秩是一個鄰接矩陣G 的秩。2009 年,黃良豪博士、張鎮華教授、葉鴻國教授等人已經完整的描繪出當連通圖之秩為4 時此圖的所有特徵。在本篇碩士論文中我們考慮以下兩個問題:(1)考慮連通圖G具有rank(G) = 5且從圖G中拿掉任何點v 皆會有rank(G-v)=3 時,圖G 的特徵。(2) 考慮連通圖G 具有rank(G) = 5且從圖G中拿掉任何點v皆會有rank(G-v)=4 時,圖G的特徵。在這篇論文我們已經完全解決這兩個問題。
摘要(英) The rank of a graph G is the rank of the adjacency matrix of G. In 2009, Chang, Huang and Yeh completely characterized the structure of a connected graph of rank
4. In this paper we consider the following two questions: (1) What is the structure of a connected graph G with the property that rank(G) = 5 and rank(G-v) = 3 for all v belong to V(G)? (2) What is the structure of a connected graph G with the property that rank(G) = 5 and rank(G-v) = 4 for all v belong to V(G)? In this paper we completely resolve these two questions.
關鍵字(中) ★ 秩
★ 五
★ 鄰接矩陣關鍵字(英) ★ multiplication of vertices
★ graph
★ rank
★ five論文目次 1 Introduction and preliminaries 1
2 Main results 3
References 41
參考文獻 [1] J. A. Bondy and U. S. R. Murty, Graph theory, Graduate Texts in Mathematics, Vol. 244, Springer-Verlag, New York, 2008.
[2] Gerard J. Chang, Liang-Hao Huang and Hong-Gwa Yeh, A characterization of n-vertex graphs with nullity n ¡ 4, submitted, 2009.
[3] Bo Cheng and Bolian Liu, On the nullity of graphs, Electronic Journal of Linear Algebra, 16 (2007) 60-67.
[4] L. Collatz and U. Sinogowitz, Spektren endlicher grafen, Abh. Math. Sere. Univ. Hamburg 21 (1957) 63-77.
[5] M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
指導教授 葉鴻國(Hong-Gwa Yeh) 審核日期 2010-6-28 推文 plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
網路書籤 Google bookmarks
del.icio.us
hemidemi
myshare