首页 | 本学科首页   官方微博 | 高级检索  
     


The competition-common enemy graph of a digraph
Affiliation:Department of Mathematics, Univ. of WI - Green Bay, 2420 Nicolet Drive, Green Bay, WI 54301-7001, USA
Abstract:
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 any two species which have a common prey and a common enemy. Results analogous to those found for competition graphs are obtained.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号