BIBLIOGRAPHY ON DOMINATION IN GRAPHS AND SOME BASIC DEFINITIONS OF DOMINATION PARAMETERS

被引：102

作者：

HEDETNIEMI, ST ^{[1
]}

LASKAR, RC ^{[1
]}

机构：

[1] CLEMSON UNIV,DEPT MATH SCI,CLEMSON,SC 29631

来源：

关键词：

D O I：

10.1016/0012-365X(90)90365-O

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：257 / 277

页数：21

共 279 条

[1] Abbott, Liu, Bounds for the covering number of a graph, Discrete Math., 25, 3, pp. 281-284, (1979)
[2] Acharya, The strong domination number of a graph and related concepts, J. Math. Phys. Sci., 14, 5, pp. 471-475, (1980)
[3] Acharya, Walikar, On graphs having unique minimum dominating sets, Graph Theory Newsletter, 8, 5, (1979)
[4] Ahrens, Mathematishe Unterhaltungen und Spiele, (1901)
[5] Aigner, Some theorems on coverings, Studia Sci. Math. Hungar., 5, pp. 303-315, (1970)
[6] Allan, Laskar, On domination and independent domination numbers of a graph, Discrete Math., 23, pp. 73-76, (1978)
[7] Allan, Laskar, On domination and some related topics in graph theory, Proceedings Ninth S.E. Conference on Combinatorics, Graph Theory and Computing, pp. 43-58, (1978)
[8] Allan, Laskar, Hedetniemi, A note on total domination, Discrete Math., 49, pp. 7-13, (1984)
[9] Anciaux-Mundeleer, Hansen, On kernels in strongly connected graphs, Networks, 7, 3, pp. 263-266, (1977)
[10] Andreas, Graphs with unique maximal clumpings, Journal of Graph Theory, 2, 1, pp. 19-24, (1978)