Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 남윤순 | - |
dc.date.accessioned | 2016-08-28T11:08:39Z | - |
dc.date.available | 2016-08-28T11:08:39Z | - |
dc.date.issued | 2001 | - |
dc.identifier.issn | 0381-7032 | - |
dc.identifier.other | OAK-662 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/218775 | - |
dc.description.abstract | Let D be a digraph. The competition-common enemy graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w, u), (w, v), (u, x), and (v, x) are arcs of D. We call a graph a CCE-graph if it is the competition-common enemy graph of some digraph. We also call a graph G = (V, E) CCE-orientable if we can give an orientation F of G so that whenever (w, u), (w, v), (u, x), and (v, x) are in F, either (u, v) or (v, u) is in F. Bak et al. [1997] found a large class of graphs that are CCE-orientable and proposed an open question of finding graphs that are not CCE-orientable. In this paper, we answer their question by presenting two families of graphs that are not CCE-orientable. We also give a CCE-graph that is not CCE-orientable, which answers another question proposed by Bak et al. [1997]. Finally we find a new family of graphs that are CCE-orientable. | - |
dc.language | English | - |
dc.title | Two families of graphs that are not CCE-orientable | - |
dc.type | Article | - |
dc.relation.volume | 58 | - |
dc.relation.index | SCIE | - |
dc.relation.index | SCOPUS | - |
dc.relation.startpage | 3 | - |
dc.relation.lastpage | 12 | - |
dc.relation.journaltitle | Ars Combinatoria | - |
dc.identifier.wosid | WOS:000168043000001 | - |
dc.identifier.scopusid | 2-s2.0-0039190146 | - |
dc.author.google | Fisher D.C. | - |
dc.author.google | Kim S.-R. | - |
dc.author.google | Park C.H. | - |
dc.author.google | Nam Y. | - |
dc.date.modifydate | 20160429000000 | - |