Some Forbidden Subgraphs of Trees Being Opposition Graphs

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

DC Field	Value	Language
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	2017-07-12T07:13:57Z	-
dc.date.available	2017-07-12T07:13:57Z	-
dc.date.issued	2017-07-12T07:13:57Z	-
dc.identifier.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	10.11648/j.dmath.20170203.20	-
dc.doi.uri	http://dx.doi.org/10.11648/j.dmath.20170203.20	-
item.fulltext	With Fulltext	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.grantfulltext	restricted	-
item.openairetype	article	-
item.cerifentitytype	Publications	-
Appears in Collections:	期刊論文

File	Description	Size	Format
119-124.pdf		472.37 kB	Adobe PDF2	View/Open

Check