A complete characterization of paths that are \(m\)-step competition graphs

DOI10.1016/J.DAM.2011.04.026zbMath1294.05082OpenAlexW2152627662MaRDI QIDQ642960

Eva Belmont

Publication date: 27 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.026

zbMATH Keywords

digraphpathcompetition graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

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 ⋮ On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ Phylogeny numbers of generalized Hamming graphs

Cites Work

• Unnamed Item
• The \(m\)-step competition graph of a digraph
• Connected triangle-free \(m\)-step competition graphs
• The \(m\)-step, same-step, and any-step competition graphs

This page was built for publication: A complete characterization of paths that are \(m\)-step competition graphs