The competition-common enemy graph of a digraph
type: Item
instance of: scholarly article
title: The competition-common enemy graph of a digraph
zbMATH Open document ID: 0609.05038
DOI: 10.1016/0166-218X(87)90030-8
author: Debra D. Scott
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
review text: The competition graph of a digraph was first defined in 1968 by Cohen in the study of ecosystems. The competition graph essentially relates any two species which have a common prey. In this paper, a competition-common enemy graph of a digraph is defined and studied. As the term suggests, it relates two species which have a common prey and a common enemy. Results analogous to those found for competition graphs are obtained.
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 3985255
zbMATH Keywords: competition graph
zbMATH Keywords: digraph
zbMATH Keywords: competition-common enemy graph
MaRDI profile type: Publication
cites work: A characterization of competition graphs
cites work: Q5515142
cites work: Q3039403
cites work: Q4171826
cites work: Applications of edge coverings by cliques
cites work: A characterization of competition graphs of arbitrary digraphs
full work available at URL: 0166-218x(87)90030-8
OpenAlex ID: W2067154029
description: scientific article; zbMATH DE number 3985255