A complete analysis of the convergence of \(\left\{ C^m ( D )\right\}_{m = 1}^\infty\) for a multipartite tournament \(D\)
From MaRDI portal
Publication:6611081
DOI10.1016/j.dam.2024.07.015zbMATH Open1547.05107MaRDI QIDQ6611081
Suh-Ryung Kim, Ji-Hwan Jung, Hyesun Yoon
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
multipartite tournament\(m\)-step competition graphindex of imprimitivitylast nontrivial componentlimit of Boolean matrix sequencelimit of graph sequence
Cites Work
- A complete characterization of paths that are \(m\)-step competition graphs
- 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
- On \(m\)-step competition graphs of bipartite tournaments
- The \(m\)-step competition graphs of doubly partial orders
- The \(m\)-step, same-step, and any-step competition graphs
- Combinatorial matrix theory
- 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
This page was built for publication: A complete analysis of the convergence of \(\left\{ C^m ( D )\right\}_{m = 1}^\infty\) for a multipartite tournament \(D\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611081)
