學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 Bounded Tolerance Representations for Maximal Outerplanar Graphs
作者 張宜武
Chang,Yi-Wu
Kuo,Chiu-Yun
貢獻者 應數系
日期 2012.03
上傳時間 7-Aug-2014 10:06:00 (UTC+8)
摘要 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.
關聯 International Journal of Intelligent Technologies and Applied Statistics,5(1),36-41
資料類型 article
dc.contributor 應數系en_US
dc.creator (作者) 張宜武zh_TW
dc.creator (作者) Chang,Yi-Wuen_US
dc.creator (作者) Kuo,Chiu-Yunen_US
dc.date (日期) 2012.03en_US
dc.date.accessioned 7-Aug-2014 10:06:00 (UTC+8)-
dc.date.available 7-Aug-2014 10:06:00 (UTC+8)-
dc.date.issued (上傳時間) 7-Aug-2014 10:06:00 (UTC+8)-
dc.identifier.uri (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-41en_US
dc.title (題名) Bounded Tolerance Representations for Maximal Outerplanar Graphsen_US
dc.type (資料類型) articleen