Please use this identifier to cite or link to this item:
|Title:||Some Forbidden Subgraphs of Trees Being Opposition Graphs|
|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|
|Appears in Collections:||[應用數學系] 期刊論文|
Files in This Item:
All items in 學術集成 are protected by copyright, with all rights reserved.