| dc.contributor | 應數系 | - |
| dc.creator (作者) | 張宜武 | zh-tw |
| dc.creator (作者) | Chang, Yi-Wu | en-US |
| dc.creator (作者) | Pan, Cheng-Wei | en_US |
| dc.creator (作者) | Lin, In-Jen | en_US |
| dc.date (日期) | 2017 | - |
| dc.date.accessioned | 12-Jul-2017 15:13:57 (UTC+8) | - |
| dc.date.available | 12-Jul-2017 15:13:57 (UTC+8) | - |
| dc.date.issued (上傳時間) | 12-Jul-2017 15:13:57 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/111020 | - |
| dc.description.abstract (摘要) | In this paper, we use the number of vertices with degree greater than or equal to 3 as a criterion for trees being opposition graphs. Finally, we prove some families of graphs such as the complement of Pn, Cn with n≥3 and n = 4k, for k∈ℕ, are opposition graphs and some families of graphs such as the complement of Tn, Cn with n≥3 and n ≠ 4k, for k∈ℕ, are not opposition graphs. | - |
| dc.format.extent | 483706 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | International Journal of Discrete Mathematics, 2(3), 119-124 | - |
| dc.subject (關鍵詞) | Trees; Orientations; Opposition Graphs | - |
| dc.title (題名) | Some Forbidden Subgraphs of Trees Being Opposition Graphs | - |
| dc.type (資料類型) | article | - |
| dc.identifier.doi (DOI) | 10.11648/j.dmath.20170203.20 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.11648/j.dmath.20170203.20 | - |
