The \(m\)-step, same-step, and any-step competition graphs
From MaRDI portal
Publication:2576346
DOI10.1016/j.dam.2005.04.005zbMath1080.05095OpenAlexW2043882814MaRDI QIDQ2576346
Publication date: 27 December 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.005
Related Items (12)
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 ⋮ Digraphs whose \(m\)-step competition graphs are trees ⋮ A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive ⋮ Competition periods of multipartite tournaments ⋮ The \(m\)-step competition graphs of doubly partial orders ⋮ A complete characterization of paths that are \(m\)-step competition graphs ⋮ On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected ⋮ Connected triangle-free \(m\)-step competition graphs ⋮ Characterizing paths as \(m\)-step competition graphs ⋮ The competition number of a graph whose holes do not overlap much ⋮ Note on the \(m\)-step competition numbers of paths and cycles
Cites Work
This page was built for publication: The \(m\)-step, same-step, and any-step competition graphs
