Domination in Kneser graphs

Previous | Up | Next

Article

Domination in Kneser graphs. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 147-152

Keywords:
dominating set; domination number; Kneser graph; domatic number; total domination number; total domatic number

Summary:
The domination number and the domatic number of a certain special type of Kneser graphs are determined.

References:

[1] E. J. Cockayne S. T. Hedetniemi: Towards a theory of domination in graphs. Networks 7 (1977), 247-261. DOI 10.1002/net.3230070305 | MR 0483788

[2] E. J. Cockayne R. M. Dawes S. T. Hedetniemi: Total domination in graphs. Networks 10 (1980), 211-219. DOI 10.1002/net.3230100304 | MR 0584887

[3] F. Harary: Graph Theory. Addison-Wesley, Reading, Mass., 1969. MR 0256911 | Zbl 0196.27202

[4] M. Kneser: Aufgabe 300. Jahrber. Deutsch. Math. Verein 58 (1978), 319-324.

[5] L. Lovász: Kneser's conjecture, chromatic number and homotopy. J. Combin. Theory A 25 (1978), 319-324. DOI 10.1016/0097-3165(78)90022-5 | MR 0514625 | Zbl 0418.05028

[6] H. M. Mulder: The Interval Function of a Graph. Math. Centrum Amsterdam, 1980. MR 0605838 | Zbl 0446.05039

Partner of