Abstract
If D = (V, A) is a digraph, its competition hypergraph \(C {\mathcal H}(D)\) has vertex set V and \(e {\subseteq} V\) is an edge of \(C {\mathcal H} (D)\) iff \(|e| {\geq} 2\) and there is a vertex \(v {\in} V\) , such that e = {w ∈ V|(w, v) ∈ A}. For several products D 1 ∘ D 2 of digraphs D 1 and D 2, we investigate the relations between the competition hypergraphs of the factors D 1, D 2 and the competition hypergraph of their product D 1 ∘ D 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bang–Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2001)
Cohen, J.E.: Interval graphs and food webs: a finding and a problem. Rand Corporation Document 17696-PR, Santa Monica, CA (1968)
Imrich, W., Klavzar, S.: Product graphs. John Wiley & Sons, Inc., New York (2000)
Kim, S.R.: The competition number and its variants. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo vadis, graph theory? Ann. of Discr. Math. 55, 313–326 (1993)
Lundgren, J.R.: Food webs, competition graphs, competition–common enemy graphs and niche graphs. In: Roberts, F. (ed.) Applications of Combinatorics and Graph Theory to the Biological and Social Sciences. IMA 17, Springer, New York, pp. 221–243 (1989)
Roberts, F.S.: Competition graphs and phylogeny graphs. In: Lovász, L. (ed.) Graph theory and combinatorial biology., Proc. int. colloqu. Balatonlelle (Hungary) 1996, Bolyai Soc. Math. Studies vol. 7, Budapest, pp. 333–362 (1999)
Sonntag, M., Teichert, H.-M.: Competition hypergraphs. Discr. Appl. Math. 143, 324–329 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sonntag, M., Teichert, HM. Competition Hypergraphs of Products of Digraphs. Graphs and Combinatorics 25, 611–624 (2009). https://doi.org/10.1007/s00373-005-0868-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-005-0868-9