Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/85497| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 張宜武 | zh_TW |
| dc.contributor.author | 陳彥賓 | zh_TW |
| dc.creator | 陳彥賓 | zh_TW |
| dc.date | 2000 | en_US |
| dc.date.accessioned | 2016-04-18T08:31:46Z | - |
| dc.date.available | 2016-04-18T08:31:46Z | - |
| dc.date.issued | 2016-04-18T08:31:46Z | - |
| dc.identifier | A2002001739 | en_US |
| dc.identifier.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 | 87751010 | zh_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 | 封面頁\r\n證明書\r\n致謝詞\r\n論文摘要\r\n目錄\r\n1 INTRODUCTION\r\n2 GRAPHS WITH BEAM NUMBER AT LEAST 4\r\n3 CHARACTERIZATION OF LINEAR SUBSTAR GRAPHS\r\nREFERENCES | zh_TW |
| dc.source.uri | http://thesis.lib.nccu.edu.tw/record/#A2002001739 | en_US |
| dc.subject | 交集表示 | zh_TW |
| dc.subject | 毛蟲 | zh_TW |
| dc.subject | 星 | zh_TW |
| dc.title | 線星圖的特徵 | zh_TW |
| dc.title | Characterization of Linear Substar Graphs | en_US |
| dc.type | thesis | en_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.\r\n[2] J.R. Blair and B.W. Peyton, An introduction to chordal graphs and clique trees, Tech. report, Oak Ridge National Laboratory, 1992.\r\n[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.\r\n[4] P.A. Buneman, A characterization of rigid circuit graphs, Discrete Math. 9 (1974), 205-212.\r\n[5] Y.W. Chang, Graph representations using stars, trees, intervals and boxes, Ph. D. Thesis, University of Illinois at Urbana-Champaign (1994).\r\n[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.\r\n[7] F. Gavn`l, The intersection graphs of subtrees in tree are exactly the chordal graphs, J. Comb. Theory B 16 (1959), 47-56.\r\n[8] J.R. Walter, Representations of chordal graphs as subtrees of a tree, J. Graph Theory 2 (1978), 265-267.\r\n[9] D.B. West, Parameters in partial orders and graphs:Packing, coving and representation , Graphs and Order 2 (1985), 267-350.\r\n[10] D.B. West, Introduction to graph theory, 1996, 293-297. | zh_TW |
| item.fulltext | With Fulltext | - |
| item.grantfulltext | open | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
| item.openairetype | thesis | - |
| item.cerifentitytype | Publications | - |
| Appears in Collections: | 學位論文 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| index.html | 115 B | HTML2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.