Article
Full entry |
PDF
(0.2 MB)
Feedback
Keywords:
cut-vertex; dominating set; minimal acyclic dominating set; acyclic domination number; upper acyclic domination number
cut-vertex; dominating set; minimal acyclic dominating set; acyclic domination number; upper acyclic domination number
Summary:
The paper studies minimal acyclic dominating sets, acyclic domination number and upper acyclic domination number in graphs having cut-vertices.
References:
[1] R. C. Brigham, P. Z. Chinn, R. D. Dutton: Vertex domination-critical graphs. Networks 18 (1988), 173–179. DOI 10.1002/net.3230180304 | MR 0953920
[2] G. H. Fricke, T. W. Haynes, S. M.Hedetniemi, S. T. Hedetniemi, R. C. Laskar: Excellent trees. Bull. Inst. Comb. Appl. 34 (2002), 27–38. MR 1880562
[3] F. Harary, T. W. Haynes: Conditional graph theory IV: Dominating sets. Util. Math. 48 (1995), 179–192. MR 1358599
[4] T. W. Haynes, S. T. Hedetniemi, P. J. Slater: Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998. MR 1605684
[5] T. W. Haynes, S. T. Hedetniemi, P. J. Slater (eds.): Domination in Graphs—Advanced Topics. Marcel Dekker, New York, 1998. MR 1605685
[6] S. M. Hedetniemi, S. T. Hedetniemi, D. F. Rall: Acyclic domination. Discrete Math. 222 (2000), 151–165. DOI 10.1016/S0012-365X(00)00012-1 | MR 1771395
[7] P. D. Vestergaard, B. Zelinka: Cut-vertices and domination in graphs. Math. Bohem. 120 (1995), 135–143. MR 1357598
Search
Partner of