The m-step competition graph of a digraph
From MaRDI portal
DOI10.1016/S0166-218X(00)00214-6zbMATH Open0966.05066MaRDI QIDQ1582072FDOQ1582072
Authors: Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam 
Publication date: 12 August 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- Combinatorial matrix theory
- A characterization of competition graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterization of n-path graphs and of graphs having \(n\)-th root
- Title not available (Why is that?)
- The competition-common enemy graph of a digraph
- Niche graphs
- \(p\)-competition graphs
- Niche numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some recent results on niche graphs
- Title not available (Why is that?)
- On the Computation of the Competition Number of a Graph
- Primes in the semigroup of Boolean matrices
- Prime Boolean matrices and factorizations
- On \(1\,0\,1\)-clear \((0,1)\) matrices and the double competition number of bipartite graphs
- Title not available (Why is that?)
- Two-step graphs of trees
- The double competition number of some triangle-free graphs
- Inverting graphs of rectangular matrices
- Title not available (Why is that?)
- Competition graphs and clique dimensions
- On the inequality \(dk(G)\leq k(G)+1\)
- Title not available (Why is that?)
- Chromatic numbers of competition graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (43)
- Title not available (Why is that?)
- Two-step graphs of trees
- Title not available (Why is that?)
- On generalized competition index of a primitive tournament
- The (1,2)-step competition graph of a tournament
- Coopetition bunch graphs: competition and cooperation on COVID19 research
- The \(m\)-step, same-step, and any-step competition graphs
- Generalized competition indices of symmetric primitive digraphs
- Generalized competition index of a primitive digraph
- Matrix periods and competition periods of Boolean Toeplitz matrices
- Note on the \(m\)-step competition numbers of paths and cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval-valued intuitionistic fuzzy competition graph
- The scrambling index of symmetric primitive matrices
- Connected triangle-free \(m\)-step competition graphs
- Fuzzy \(k\)-competition graphs and \(p\)-competition fuzzy graphs
- A complete analysis of the convergence of \(\left\{ C^m ( D )\right\}_{m = 1}^\infty\) for a multipartite tournament \(D\)
- Competition graphs of degree bounded digraphs
- On \(m\)-step competition graphs of bipartite tournaments
- Generalized competition index of primitive digraphs
- \(m\)-step fuzzy competition graphs
- On \((1, 2)\)-step competition graphs of bipartite tournaments
- The \(m\)-step competition graphs of doubly partial orders
- The competition hypergraphs of doubly partial orders
- Intuitionistic fuzzy competition graphs
- Digraphs whose \(m\)-step competition graphs are trees
- A complete characterization of paths that are \(m\)-step competition graphs
- The \((i,k)\)-step competition graph of a round decomposable locally semicomplete digraph
- 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\)
- Bounds on the generalized \(\mu \)-scrambling indices of primitive digraphs
- Analysis of the effect of medicines over bacteria based on competition graphs with picture fuzzy environment
- Some bounds of the generalized \(\mu \)-scrambling indices of primitive digraphs with \(d\) loops
- On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected
- Fuzzy \(\phi\)-tolerance competition graphs
- The niche graphs of bipartite tournaments
- Factorizations of matrices over semirings.
- Oligopolistic competition among the wireless Internet service providers of Malaysia using fuzzy soft graphs
- Competition periods of multipartite tournaments
- Competition graphs under complex Pythagorean fuzzy information
- Phylogeny numbers of generalized Hamming graphs
This page was built for publication: The \(m\)-step competition graph of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582072)
