The m-step, same-step, and any-step competition graphs

DOI10.1016/J.DAM.2005.04.005MaRDI QIDQ2576346zbMATH OpenOpenAlexFDO

Authors Wei Ho

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

zbMATH Keywords

competition number

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory (05C90)

Recommendations

• The \(m\)-step competition graph of a digraph
• On the trees whose 2-step competition numbers are two.
• Note on the m-step competition numbers of paths and cycles
• Connected triangle-free \(m\)-step competition graphs
• scientific article; zbMATH DE number 6277695

Cites work

• \(p\)-competition graphs
• Connected triangle-free \(m\)-step competition graphs
• scientific article; zbMATH DE number 434915 (Why is no real title available?)
• scientific article; zbMATH DE number 6009 (Why is no real title available?)
• On the Computation of the Competition Number of a Graph
• The \(m\)-step competition graph of a digraph
• The competition-common enemy graph of a digraph

Cited in

(17)

• 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
• A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive
• On \(m\)-step competition graphs of bipartite tournaments
• The m-step competition graphs of doubly partial orders
• On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected
• scientific article; zbMATH DE number 6311310 (Why is no real title available?)
• scientific article; zbMATH DE number 7071939 (Why is no real title available?)
• scientific article; zbMATH DE number 6277695 (Why is no real title available?)
• 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
• Competition periods of multipartite tournaments
• A complete characterization of paths that are m-step competition graphs
• A complete analysis of the convergence of \(\left\{ C^m ( D )\right\}_{m = 1}^\infty\) for a multipartite tournament \(D\)
• Characterizing paths as \(m\)-step competition graphs
• The competition number of a graph whose holes do not overlap much

This page was built for publication: The \(m\)-step, same-step, and any-step competition graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576346)