The competition number of a graph and the dimension of its hole space

@article{Kim2012TheCN,
  title={The competition number of a graph and the dimension of its hole space},
  author={Suh-Ryung Kim and Jung Yeun Lee and Boram Park and Yoshio Sano},
  journal={Appl. Math. Lett.},
  year={2012},
  volume={25},
  pages={638-642}
}
The competition graph of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x, v) and (y, v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of G is the smallest number of such isolated vertices. In general, it is hard to compute the competition number k(G) for a graph G… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
11 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 11 references

Roberts : Competition number of graphs with a small number of triangles

  • S. F.
  • Discrete Appl . Math .
  • 2010

The competition number and its variants

  • J. Gimbel, J. W. Kennedy, L. V. Quintas
  • Discrete Appl . Math .
  • 2010

Opsut : On the computation of the competition number of a graph

  • J. R.
  • SIAM J . Alg . Discr . Meth .
  • 1982

Food webs , competition graphs , competitioncommon enemy graphs , and niche graphs

  • J. R. Lundgren
  • Applications of Combinatorics and Graph Theory to…

Generalized competition graphs and their applications

  • A. Raychaudhuri, F. S. Roberts

Similar Papers

Loading similar papers…