Pages that link to "Item:Q642960"

The following pages link to A complete characterization of paths that are \(m\)-step competition graphs (Q642960):

Displaying 13 items.

• A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
• Characterizing paths as \(m\)-step competition graphs (Q708427) (← links)
• Note on the \(m\)-step competition numbers of paths and cycles (Q1026165) (← links)
• The \(m\)-step competition graph of a digraph (Q1582072) (← links)
• A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive (Q1938687) (← links)
• Phylogeny numbers of generalized Hamming graphs (Q2082421) (← links)
• On \(m\)-step competition graphs of bipartite tournaments (Q2192078) (← links)
• The \(m\)-step competition graphs of doubly partial orders (Q2430029) (← links)
• On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected (Q2448228) (← links)
• On the limit of the sequence \(\{ C^m ( D ) \}_{m = 1}^\infty\) for a multipartite tournament \(D\) (Q6094707) (← links)
• Digraphs whose \(m\)-step competition graphs are trees (Q6110613) (← links)
• Competition periods of multipartite tournaments (Q6160519) (← links)
• A complete analysis of the convergence of \(\left\{ C^m ( D )\right\}_{m = 1}^\infty\) for a multipartite tournament \(D\) (Q6611081) (← links)