政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/85497
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113648/144635 (79%)
造訪人次 : 51664902      線上人數 : 586
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/85497
    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/85497


    題名: 線星圖的特徵
    Characterization of Linear Substar Graphs
    作者: 陳彥賓
    貢獻者: 張宜武
    陳彥賓
    關鍵詞: 交集表示
    毛蟲
    日期: 2000
    上傳時間: 2016-04-18 16:31:46 (UTC+8)
    摘要: 在這篇論文中,我們探討圖的交集表示之參數。在一圖形之交集表示中,每一點都能從一毛蟲(caterpillar)中分配到至多t個星(star),我們稱此表示為t-線星表示。我們稱此最小的t使得此圖形有一t-線星表示為此圖形的線星數。而線星數為1的圖形,則稱為線星圖。在這篇論文中,我們找出線星圖所不能包含的子圖,即線星圖為1的特徵。
    In this thesis, we study intersection parameters for graphs. We introduce linear star number of a graph G, which is the minimum t such that G is the intersection graph of unions of t stars of a host tree that is a caterpillar. The graphs with linear star number 1 are called linear graphs. This thesis is to characterize graphs which are linear substar graphs by providing forbidden induced subgraphs.
    參考文獻: [1] S. Benzer, On the topology of genetic fine structure, Pro. Nata. Acad. Sci. U.S.A. 45 (1959), 1607-1620.
    [2] J.R. Blair and B.W. Peyton, An introduction to chordal graphs and clique trees, Tech. report, Oak Ridge National Laboratory, 1992.
    [3] J.Ch. Boland and C.B. Lekkerkerker, Representation of finite graph by a set of intervals on the real line, Fund. Math. 51 (1962), 45-64.
    [4] P.A. Buneman, A characterization of rigid circuit graphs, Discrete Math. 9 (1974), 205-212.
    [5] Y.W. Chang, Graph representations using stars, trees, intervals and boxes, Ph. D. Thesis, University of Illinois at Urbana-Champaign (1994).
    [6] Y.W. Chang, M.S. Jacobson, C.L. Monma and D.B. West, Subtree and substar intersection numbers, Discrete Appl. Math. 44 (1993), 205-220.
    [7] F. Gavn`l, The intersection graphs of subtrees in tree are exactly the chordal graphs, J. Comb. Theory B 16 (1959), 47-56.
    [8] J.R. Walter, Representations of chordal graphs as subtrees of a tree, J. Graph Theory 2 (1978), 265-267.
    [9] D.B. West, Parameters in partial orders and graphs:Packing, coving and representation , Graphs and Order 2 (1985), 267-350.
    [10] D.B. West, Introduction to graph theory, 1996, 293-297.
    描述: 碩士
    國立政治大學
    應用數學系
    87751010
    資料來源: http://thesis.lib.nccu.edu.tw/record/#A2002001739
    資料類型: thesis
    顯示於類別:[應用數學系] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML2278檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋