The competition numbers of complete tripartite graphs |
| |
| Authors: | Suh-Ryung Kim |
| |
| Institution: | a Department of Mathematics Education, Seoul National University, Seoul 151-742, Republic of Korea
b Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606-8502, Japan |
| |
| Abstract: | For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition numbers of complete tripartite graphs. |
| |
| Keywords: | Competition graph Competition number Complete tripartite graph |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
