# On $m$-step competition graphs of bipartite tournaments

## TL;DR

This paper characterizes the structure of m-step competition graphs of bipartite tournaments for all m ≥ 2, and calculates their competition index and period, advancing understanding of their properties.

## Contribution

It provides a complete characterization of m-step competition graphs of bipartite tournaments and computes their competition index and period, which were previously unknown.

## Key findings

- Complete characterization of m-step competition graphs for bipartite tournaments
- Calculation of the competition index for bipartite tournaments
- Determination of the competition period for bipartite tournaments

## Abstract

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