On m-step competition graphs of bipartite tournaments

2019/03/13 by Soogang Eoh, Eoh, Soogang, Suh-Ryung Kim +3
Computer Science · Decision Sciences · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Game Theory and Applications #ICT Impact and Policies

paper · pdf · doi:10.48550/arxiv.1903.05332

openalex publication_date 2019/03/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we completely characterize the m-step competition graph of a bipartite tournament for any integer m ≥ 2. In addition, we compute the competition index and the competition period of a bipartite tournament.

Related

• On (1,2)-step competition graphs of bipartite tournaments
• On (1,2)-step competition graphs of multipartite tournaments
• On competition indices and periods of multipartite tournaments
• On (1,2)-step competition graphs of multipartite tournaments II
• The niche graphs of bipartite tournaments