On \(m\)-step competition graphs of bipartite tournaments

DOI10.1016/j.dam.2020.01.002zbMath1442.05074arXiv1903.05332OpenAlexW4206925541WikidataQ126288438 ScholiaQ126288438MaRDI QIDQ2192078

Suh-Ryung Kim, Hyesun Yoon, Soogang Eoh

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite tournamentcompetition index\(m\)-step competition graphcompetition periodsink elimination indexsink sequence

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Competitively orientable complete multipartite graphs ⋮ On the limit of the sequence \(\{ C^m ( D ) \}_{m = 1}^\infty\) for a multipartite tournament \(D\) ⋮ Digraphs whose \(m\)-step competition graphs are trees ⋮ Competition periods of multipartite tournaments

Cites Work

• A complete characterization of paths that are \(m\)-step competition graphs
• Inverting graphs of rectangular matrices
• Note on the \(m\)-step competition numbers of paths and cycles
• The \(m\)-step competition graph of a digraph
• Connected triangle-free \(m\)-step competition graphs
• The \(m\)-step competition graphs of doubly partial orders
• The \(m\)-step, same-step, and any-step competition graphs
• COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS
• COMPETITION INDICES OF TOURNAMENTS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(m\)-step competition graphs of bipartite tournaments