Note on the \(m\)-step competition numbers of paths and cycles

DOI10.1016/J.DAM.2009.01.010zbMath1229.05189OpenAlexW1993487600MaRDI QIDQ1026165

Yongqiang Zhao, Gerard Jennhwa Chang

Publication date: 24 June 2009

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

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

zbMATH Keywords

competition graphcompetition number\(m\)-step competition graph\(m\)-step competition number

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (9)

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 ⋮ The competition numbers of ternary Hamming graphs ⋮ Characterizing paths as \(m\)-step competition graphs ⋮ The competition number of a graph whose holes do not overlap much

Cites Work

• Unnamed Item
• Unnamed Item
• The competition numbers of complete tripartite graphs
• Competition numbers of graphs with a small number of triangles
• 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
• On the Computation of the Competition Number of a Graph

This page was built for publication: Note on the \(m\)-step competition numbers of paths and cycles