1. NCCU Academic Hub
  2. Publications
  3. College of Science
  4. Theses
  5. Item

Publications-Theses

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 線星圖的特徵
Characterization of Linear Substar Graphs
作者 陳彥賓
貢獻者 張宜武
陳彥賓
關鍵詞 交集表示
毛蟲
星
日期 2000
上傳時間 18-Apr-2016 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
dc.contributor.advisor 張宜武zh_TW
dc.contributor.author (Authors) 陳彥賓zh_TW
dc.creator (作者) 陳彥賓zh_TW
dc.date (日期) 2000en_US
dc.date.accessioned 18-Apr-2016 16:31:46 (UTC+8)-
dc.date.available 18-Apr-2016 16:31:46 (UTC+8)-
dc.date.issued (上傳時間) 18-Apr-2016 16:31:46 (UTC+8)-
dc.identifier (Other Identifiers) A2002001739en_US
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/85497-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 應用數學系zh_TW
dc.description (描述) 87751010zh_TW
dc.description.abstract (摘要) 在這篇論文中，我們探討圖的交集表示之參數。在一圖形之交集表示中，每一點都能從一毛蟲（caterpillar）中分配到至多t個星（star），我們稱此表示為t-線星表示。我們稱此最小的t使得此圖形有一t-線星表示為此圖形的線星數。而線星數為1的圖形，則稱為線星圖。在這篇論文中，我們找出線星圖所不能包含的子圖，即線星圖為1的特徵。zh_TW
dc.description.abstract (摘要) 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.en_US
dc.description.tableofcontents 封面頁
     證明書
     致謝詞
     論文摘要
     目錄
     1 INTRODUCTION
     2 GRAPHS WITH BEAM NUMBER AT LEAST 4
     3 CHARACTERIZATION OF LINEAR SUBSTAR GRAPHS
     REFERENCES		zh_TW
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#A2002001739en_US
dc.subject (關鍵詞) 交集表示zh_TW
dc.subject (關鍵詞) 毛蟲zh_TW
dc.subject (關鍵詞) 星zh_TW
dc.title (題名) 線星圖的特徵zh_TW
dc.title (題名) Characterization of Linear Substar Graphsen_US
dc.type (資料類型) thesisen_US
dc.relation.reference (參考文獻) [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.		zh_TW