𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Computation of the Competition Number of a Graph

✍ Scribed by Opsut, Robert J.


Book ID
118212996
Publisher
Society for Industrial and Applied Mathematics
Year
1982
Weight
931 KB
Volume
3
Category
Article
ISSN
0196-5212

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The competition numbers of ternary Hammi
✍ Boram Park; Yoshio Sano πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 243 KB

It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano (in press) [16] gave the exact values of the competition numbers of Hamming graphs H(n, q) if 1 ≀ n ≀ 3 or 1 ≀ q ≀ 2. In this paper, we give an explicit formula for the competition numbers