Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/84946| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 張宜武 | zh_TW |
| dc.contributor.advisor | Chang, Yi-Wu | en_US |
| dc.contributor.author | 劉宣谷 | zh_TW |
| dc.creator | 劉宣谷 | zh_TW |
| dc.date | 2001 | en_US |
| dc.date.accessioned | 2016-04-15T08:02:46Z | - |
| dc.date.available | 2016-04-15T08:02:46Z | - |
| dc.date.issued | 2016-04-15T08:02:46Z | - |
| dc.identifier | A2002001137 | en_US |
| dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/84946 | - |
| dc.description | 碩士 | zh_TW |
| dc.description | 國立政治大學 | zh_TW |
| dc.description | 應用數學系 | zh_TW |
| dc.description.abstract | In this thesis, we study relationships between linear star number and star number and obtain bounds on the linear star number. We obtain an upper bound on linear star number in term of star number：s*(G) ≦ 3s(G). When we forbid certain induced subgraphs, we obtain an upper bound on linear star number. If G is a graph without induced K4－e., we prove that s*(G) ≦ s(G)+1. And, the linear star number of the triangle-free graph is also bounded by s(G)+1. The linear star number and star number are equal when G is a graph with △(G)=3. When G is a graph with △(G)=4, we also obtain s*(G)≦s(G)+1. | en_US |
| dc.description.tableofcontents | 封面頁\r\n證明書\r\n致謝詞\r\n論文摘要\r\n目錄\r\nChapter1 Introduction\r\nChapter2 A General Upper Bound of Linear star Number\r\nChapter3 Bounds of Linear Star Number in Restricted classes\r\nBibliography | zh_TW |
| dc.source.uri | http://thesis.lib.nccu.edu.tw/record/#A2002001137 | en_US |
| dc.subject | 星形表示法 | zh_TW |
| dc.subject | 線星表示法 | zh_TW |
| dc.subject | 毛毛蟲 | zh_TW |
| dc.subject | Star representation | en_US |
| dc.subject | Linear star representation | en_US |
| dc.subject | Caterpillar | en_US |
| dc.title | 線星數極值問題 | zh_TW |
| dc.title | Extremal Problems for Linear Star Number | en_US |
| dc.type | thesis | en_US |
| dc.relation.reference | BOOK{texbook, author = {Douglas B. West}, year = 1996, title = {Introduction to Graph Theory}, publisher = {PRENTICE HALL} }\r\nARTICLE{Gav, author={F. Gavril}, title={The intersection graphs of subtrees in trees are exactly the chordal graphs}, journal={J. Combinatorics Theory B}, volume={16}, year={1974}, pages={45-56},}\r\nARTICLE{Bun, author={P.A. Buneman}, title={A characterization of rigid circuit graphs}, journal={Discrete Math}, volume={9}, year={1974}, pages={205-212}, }\r\nARTICLE{Wal, author={J.R. Walter}, title={Representations of chordal graphs as subtrees of a tree}, journal={J. Graph Theory}, volume={2}, year={1978}, pages={265-267},}\r\nARTICLE{Wes, author={D.B. West}, title={Parameters in partial orders and graphs:Packing, covering, and representation}, journal={Graphs and Order}, volume={2}, year={1985}, pages={267-350},}\r\nPHDTHESIS{Chang, author={Yi-Wu Chang}, title={Graph Representations Using Star, Tree, Intervals And Boxes}, school={M.S., University of Illinois}, year={1994},} | zh_TW |
| item.fulltext | With Fulltext | - |
| item.grantfulltext | open | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
| item.cerifentitytype | Publications | - |
| item.openairetype | thesis | - |
| 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.