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

DOI10.1016/J.DAM.2011.04.026zbMATH Open1294.05082OpenAlexW2152627662MaRDI QIDQ642960FDOQ642960

Authors: 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

Recommendations

• Characterizing paths as \(m\)-step competition graphs
• The (1,2)-step competition graph of a tournament
• The \(m\)-step competition graph of a digraph
• Connected triangle-free \(m\)-step competition graphs
• On \(m\)-step competition graphs of bipartite tournaments

zbMATH Keywords

competition graphdigraphpath

Mathematics Subject Classification ID

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

Cites Work

• Connected triangle-free \(m\)-step competition graphs
• Title not available (Why is that?)
• The \(m\)-step competition graph of a digraph
• The \(m\)-step, same-step, and any-step competition graphs

Cited In (13)

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

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

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