超竞赛图的(1,2)步竞争图
The (1,2)-step competition graph of a hypertournament
摘要:
建立了与生物模型相联系的竞争图,以反映食物网中捕食者之间的竞争关系,确定生态相空间的最小维数。2011年,Factor和Merz引入了有向图的(1,2)-步竞争图。给定一个有向图$D=(V,A)$,$D$的(1,2)步竞争图,记为$C_{1,2}(D)$,是$V(D)$上的图,其中$xy\in E(C_{1,2}(D))$当且仅当存在一个顶点$z\neq x,y$使得$d_{D-y}(x,z)=1$和$d_{D-x}(y,z)\leq 2$或$d_{D-x}(y,z)=1$和$d_{D-y}(x,z)\leq 2$.他们还刻画了竞赛图的(1,2)-步竞争图,并将一些结果推广到竞赛图的$(i,j)$-步竞争图.本文将有向图的(1,2)步竞争图的定义推广到超竞赛图的(1,2)步竞争图,并刻画了$k$-超竞赛图的$(1,2)$步竞争图.同时,将所得结果推广到$k$-超锦标赛的$(i,j)$-步竞争图.
英文摘要:
Competition graphs were created in connected to a biological model as a means of reflecting the competition relations among the predators in the food webs and determining the smallest dimension of ecological phase space. In 2011, Factor and Merz introduced the (1,2)-step competition graph of a digraph. Given a digraph $D=(V,A)$, the (1,2)-step competition graph of $D$, denoted $C_{1,2}(D)$, is a graph on $V(D)$ where $xy\in E(C_{1,2}(D))$ if and only if there exists a vertex $z\neq x,y$ such that either $d_{D-y}(x,z)=1$ and $d_{D-x}(y,z)\leq 2$ or $d_{D-x}(y,z)=1$ and $d_{D-y}(x,z)\leq 2$. They also characterized the (1,2)-step competition graphs of tournaments and extended some results to the $(i,j)$-step competition graphs of tournaments. In this paper, the definition of the (1,2)-step competition graph of a digraph is generalized to the one of a hypertournament and the $(1,2)$-step competition graph of a $k$-hypertournament is characterized. Also, the results are extended to the $(i,j)$-step competition graph of a $k$-hypertournament.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。