Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/68410
DC Field | Value | Language |
---|---|---|
dc.contributor | 應數系 | en_US |
dc.creator | 張宜武 | zh_TW |
dc.creator | Chang,Yi-Wu | en_US |
dc.creator | Kuo,Chiu-Yun | en_US |
dc.date | 2012.03 | en_US |
dc.date.accessioned | 2014-08-07T02:06:00Z | - |
dc.date.available | 2014-08-07T02:06:00Z | - |
dc.date.issued | 2014-08-07T02:06:00Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/68410 | - |
dc.description.abstract | A graph G = (V, E) is a tolerance graph if there is a set I = {Iv∣v ε V} of closed real interval and a set τ = {tv∣v ε V} of positive real numbers such that (x, y) ε E ⇔ ∣Ix ∩ Iy∣ ≥ min{τx, τy}. We show that if G is a 2-connected maximal outerplanar graph with more than two vertices of degree 2, then G has S3 as an induced subgraph. We provide a characterization of the class of 2-connected maximal outerplanar graphs that are bounded tolerance graphs. | - |
dc.format.extent | 666919 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en_US | - |
dc.relation | International Journal of Intelligent Technologies and Applied Statistics,5(1),36-41 | en_US |
dc.title | Bounded Tolerance Representations for Maximal Outerplanar Graphs | en_US |
dc.type | article | en |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | restricted | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.languageiso639-1 | en_US | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
p35-40.pdf | 651.29 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.