×
Bollobas, B.; Cockayne, E. J.

Graph-theoretic parameters concerning domination, independence, and irredundance. (English) Zbl 0418.05049

J. Graph Theory 3, 241-249 (1979).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0418.05049

Cited in 5 Reviews
Cited in 140 Documents

MSC:

05C99 Graph theory

Keywords:

communications network; irredundance number; domination number; independent domination number
Cite Review PDF
Full Text: DOI

References:

[1] Allan, Discrete math. 23 pp 73– (1978)
[2] and , On domination and some related topics in graph theory. In Proceedings of the 9th Southeast Conferest on Graph Theory, Combinatorics and Computing, Boca Raton, February, 1978. Utilitas Mathematics, Winnipeg (1978) 43–56.
[3] Theory of Graphs and its Applications. Methuen, London (1962).
[4] Graphs and Hypergraphs. North-Holland, Amsterdam (1973).
[5] Domination in undirected graphs–A survey. In Theory and Applications of Graphs in America’s Bicentennial Year, and , Eds. Springer-Verlag, Berlin (1978).
[6] and , Independence graphs. In Proceedings of 5th Southeast Conference on Combinatorics, Graph Theory and Computing. Utilitas Mathematics, Winnepeg (1974) 471–491.
[7] Cockayne, Canad. Math. Bull.
[8] Ore, Amer. math. Soc. Transl. 38 (1962)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.