The (1, 2)-step competition graph of a hypertournament

DOI10.1515/MATH-2021-0047MaRDI QIDQ2053626zbMATH OpenOpenAlexFDO

Authors Ruijuan Li, Xiaoting An, Xinhong Zhang

Publication date 29 November 2021

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1812.01796

zbMATH Keywords

\((1,2)\)-step competition graph\((i,j)\)-step competition graph\(k\)-hypertournament

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65)

Abstract: 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 $xyinE(C_{1,2}(D))$ if and only if there exists a vertex $zeqx,y$ such that either $d_{D-y}(x,z)=1$ and $d_{D-x}(y,z)leq2$ or $d_{D-x}(y,z)=1$ and $d_{D-y}(x,z)leq2$. 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.

Recommendations

• The (1,2)-step competition graph of a tournament
• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• scientific article; zbMATH DE number 7071939
• A note on the existence of edges in the (1, 2)-step competition graph of a round digraph
• On \((1, 2)\)-step competition graphs of bipartite tournaments

Cites work

• Connected triangle-free \(m\)-step competition graphs
• Edge-disjoint Hamiltonian cycles in hypertournaments
• Hamiltonian paths and cycles in hypertournaments
• Note on the degree sequences of \(k\)-hypertournaments
• On score sequences of k-hypertournaments
• On the vertex-pancyclicity of hypertournaments
• The (1,2)-step competition graph of a tournament
• The \(H\)-force set of a hypertournament
• The competition number of the complement of a cycle
• The competition numbers of complete tripartite graphs
• The domination and competition graphs of a tournament
• Vertex-pancyclicity of hypertournaments

Cited in

(10)

• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• A class of local tournaments with interval (1,2)-step competition graphs
• A note on the existence of edges in the (1, 2)-step competition graph of a round digraph
• scientific article; zbMATH DE number 6311310 (Why is no real title available?)
• scientific article; zbMATH DE number 7071939 (Why is no real title available?)
• scientific article; zbMATH DE number 6277695 (Why is no real title available?)
• The (1,2)-step competition graph of a tournament
• Generalized competitively orientable complete multipartite graphs
• Characterizing paths as \(m\)-step competition graphs
• A mathematical approach on representation of competitions: competition cluster hypergraphs

This page was built for publication: The (1, 2)-step competition graph of a hypertournament

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