scientific article; zbMATH DE number 1161365

MaRDI QIDQ4393363zbMATH OpenFDO

Authors Ok-Boon Bak, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam

Publication date 5 January 1999

zbMATH Keywords

CCE-graphCCE-orientable graphscharacterizationcompetition graphdigraphenemy graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Review text

In the literature the notions of competition graph and of competition-common enemy graph (CCE-graph) of a digraph were defined. Necessary and sufficient conditions for a graph to be a CCE-graph were also given. Here the authors find a better (more practical) characterization of CCE-graphs and give several classes of graphs which are CCE-graphs. More precisely, the authors define CCE-orientable graphs, prove that any CCE-orientable graph is a CCE-graph, and find several families of graphs that are CCE-orientable graphs. The authors say that these graphs have applications in ecology and some other disciplines, but they do not give any application.

Recommendations

• Two families of graphs that are not CCE-orientable.
• On CCE graphs of doubly partial orders
• The competition-common enemy graph of a digraph
• The competition-common enemy graphs of digraphs satisfying Conditions C(p) and C'(p)
• scientific article; zbMATH DE number 3912431

Cited in

(2)

• Two families of graphs that are not CCE-orientable.
• On CCE graphs of doubly partial orders

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393363)