Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/111020


Title: Some Forbidden Subgraphs of Trees Being Opposition Graphs
Authors: 張宜武
Chang, Yi-Wu
Pan, Cheng-Wei
Lin, In-Jen
Contributors: 應數系
Keywords: Trees;Orientations;Opposition Graphs
Date: 2017
Issue Date: 2017-07-12 15:13:57 (UTC+8)
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.
Relation: International Journal of Discrete Mathematics, 2(3), 119-124
Data Type: article
DOI 連結: http://dx.doi.org/10.11648/j.dmath.20170203.20
Appears in Collections:[應用數學系] 期刊論文

Files in This Item:

File Description SizeFormat
119-124.pdf472KbAdobe PDF216View/Open


All items in 學術集成 are protected by copyright, with all rights reserved.


社群 sharing