• KIM SUH-RYUNG (Department of Mathematics Education Seoul National University)
  • Published : 2005.11.01


Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that (u, x) and (v, x) are arcs of D. The competition number of a graph G, denoted by k(G), is the smallest number k such that G together with k isolated vertices is the competition graph of an acyclic digraph. It is known to be difficult to compute the competition number of a graph in general. Even characterizing the graphs with competition number one looks hard. In this paper, we continue the work done by Cho and Kim[3] to characterize the graphs with one hole and competition number one. We give a sufficient condition for a graph with one hole to have competition number one. This generates a huge class of graphs with one hole and competition number one. Then we completely characterize the graphs with one hole and competition number one that do not have a vertex adjacent to all the vertices of the hole. Also we show that deleting pendant vertices from a connected graph does not change the competition number of the original graph as long as the resulting graph is not trivial, and this allows us to construct infinitely many graph having the same competition number. Finally we pose an interesting open problem.


competition number;chordal graph;chordless cycle;hole


  1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North Holland, New York, 1976
  2. C. Cable, K. F. Jones, J. R. Lundgren, and S. Seager, Niche graphs, Discrete Appl. Math. 23 (1989), 231-241
  3. H. H. Cho and S-R. Kim, The Competition Number of a Graph Having Exactly One Hole, to appear in Discrete Math
  4. J. E. Cohen, Interval Graphs and Food Webs: A Finding and a Problem, RAND Corporation Document 17696-PR, Santa Monica, CA, 1968
  5. M. B. Cozzens and F. S. Roberts, T-Colorings of Graphs and the Channel As-signment Problem, Congr. Numer. 25 (1982) 191-208
  6. G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961), 71-76
  7. W. K. Hale, Frequency Assignment: Theory and Application, Proc. IEEE 68 (1980), 1497-1514
  8. P. C. Fishburn and W. V. Gehrlein, Niche numbers, J. Graph Theory 16 (1992), 131-139
  9. F. Harary, S-R. Kim, and F. S. Roberts, Competition numbers as a generalization of Turan's theorem, J. Ramanujan Math. Soc. 5 (1990), 33-43
  10. S-R. Kim, The Competition Number and Its Variants, in Quo Vadis, Graph Theory, (J. Gimbel, J. W. Kennedy, and L. V. Quintas, eds.), Annals of Discrete Mathematics 55, North Holland B. V., Amsterdam, the Netherlands, 1993, 313- 326
  11. J. R. Lundgren, Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs, in Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, (F. S. Roberts, ed.), IMH Volumes in Mathematics and Its Application, Vol. 17, Springer-Verlag, New York, 1989, 221-243
  12. R. J. Opsut, On the Computation of the Competition Number of a Graph, SIAM J. Discrete Math. 3 (1982), 420-428
  13. R. J. Opsut and F. S. Roberts, On the Fleet Maintenance, Mobile Radio fre- quency, Task Assignment and Traffc phasing Problem, The Theory and Applications of Graphs, (G. Chartrand, Y. Alavi, D. L. Goldsmith, L. Lesniak-Foster, and D. R. Lick, eds.), Wiley, New York, 1981, 479-492
  14. F. S. Roberts, Food Webs, Competition Graphs, and the Boxicity of Ecological Phase Space, Theory and Applications of Graphs, (Y. Alavi and D. Lick, eds.), Springer Verlag, New York, 1978, 477-490
  15. F. S. Roberts, Graph Theory and Its Applications to Problems of Society, SIAM, Pennsylvania, 1978
  16. D. Scott, The competition-common enemy graph of a digraph, Discrete Appl. Math. 17 (1987), 269-280
  17. S. Seager, The Double Competition Number of Some Triangle-Free Graphs, Discrete Appl. Math. 29 (1990), 265-269
  18. C. E. Shannon, The Zero Capacity of a Noisy Channel, IEEE Trans. Inform. Theory IT-2 (1956), 8-19
  19. H. H. Cho, S-R. Kim, and Y. Nam, The m-Step Competition Graph of a Digraph, Discrete Appl. Math. 105 (2000), 115-127
  20. S-R. Kim and F. S. Roberts, Competition numbers of graphs with a small number of triangles, Discrete Appl. Math. 78 (1997), 153-162

Cited by

  1. Competition Numbers of Several Kinds of Triangulations of a Sphere vol.07, pp.02, 2017,
  2. An upper bound for the competition numbers of graphs vol.158, pp.2, 2010,
  3. The competition number of a graph whose holes do not overlap much vol.158, pp.13, 2010,
  4. Competition Numbers, Quasi-line Graphs, and Holes vol.28, pp.1, 2014,
  5. The competition number of a graph with exactly two holes vol.23, pp.1, 2012,
  6. The competition number of a graph with exactly h holes, all of which are independent vol.157, pp.7, 2009,
  7. A sufficient condition for Kim’s conjecture on the competition numbers of graphs vol.312, pp.6, 2012,
  8. Graphs having many holes but with small competition numbers vol.24, pp.8, 2011,
  9. The competition number of a graph and the dimension of its hole space vol.25, pp.3, 2012,
  11. Fuzzy k-competition graphs and p-competition fuzzy graphs vol.5, pp.2, 2013,
  12. $$m$$ m -Step fuzzy competition graphs vol.47, pp.1-2, 2015,
  13. q-Rung Orthopair Fuzzy Competition Graphs with Application in the Soil Ecosystem vol.7, pp.1, 2019,