Competition periods of multipartite tournaments
From MaRDI portal
Publication:6160519
Recommendations
- On multipartite tournament matrices with constant team size∗
- The competition index of regular multipartite tournaments
- On the limit of the sequence \(\{ C^m ( D ) \}_{m = 1}^\infty\) for a multipartite tournament \(D\)
- On \(m\)-step competition graphs of bipartite tournaments
- Matrix periods and competition periods of Boolean Toeplitz matrices
Cites work
- A complete characterization of paths that are \(m\)-step competition graphs
- Characterization of irreducible Boolean matrices with the largest generalized competition index
- Connected triangle-free \(m\)-step competition graphs
- Generalized competition index of a primitive digraph
- Note on the \(m\)-step competition numbers of paths and cycles
- On \(m\)-step competition graphs of bipartite tournaments
- On multipartite tournaments
- The \(m\)-step competition graph of a digraph
- The \(m\)-step competition graphs of doubly partial orders
- The \(m\)-step, same-step, and any-step competition graphs
- The competition index of a nearly reducible Boolean matrix
Cited in
(7)- A complete analysis of the convergence of \(\left\{ C^m ( D )\right\}_{m = 1}^\infty\) for a multipartite tournament \(D\)
- A theory of multi-period contest preparation.
- On the limit of the sequence \(\{ C^m ( D ) \}_{m = 1}^\infty\) for a multipartite tournament \(D\)
- On multipartite tournament matrices with constant team size∗
- Matrix periods and competition periods of Boolean Toeplitz matrices
- Digraphs whose \(m\)-step competition graphs are trees
- Matrix periods and competition periods of Boolean Toeplitz matrices. II
This page was built for publication: Competition periods of multipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160519)
