Previous |  Up |  Next

Article

Title: Minimal acyclic dominating sets and cut-vertices (English)
Author: Samodivkin, Vladmir
Language: English
Journal: Mathematica Bohemica
ISSN: 0862-7959 (print)
ISSN: 2464-7136 (online)
Volume: 130
Issue: 1
Year: 2005
Pages: 81-88
Summary lang: English
.
Category: math
.
Summary: The paper studies minimal acyclic dominating sets, acyclic domination number and upper acyclic domination number in graphs having cut-vertices. (English)
Keyword: cut-vertex
Keyword: dominating set
Keyword: minimal acyclic dominating set
Keyword: acyclic domination number
Keyword: upper acyclic domination number
MSC: 05C40
MSC: 05C69
idZBL: Zbl 1112.05080
idMR: MR2128361
DOI: 10.21136/MB.2005.134216
.
Date available: 2009-09-24T22:18:24Z
Last updated: 2020-07-29
Stable URL: http://hdl.handle.net/10338.dmlcz/134216
.
Reference: [1] R. C. Brigham, P. Z. Chinn, R. D. Dutton: Vertex domination-critical graphs.Networks 18 (1988), 173–179. MR 0953920, 10.1002/net.3230180304
Reference: [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
Reference: [3] F. Harary, T. W. Haynes: Conditional graph theory IV: Dominating sets.Util. Math. 48 (1995), 179–192. MR 1358599
Reference: [4] T. W. Haynes, S. T. Hedetniemi, P. J. Slater: Fundamentals of Domination in Graphs.Marcel Dekker, New York, 1998. MR 1605684
Reference: [5] T. W. Haynes, S. T. Hedetniemi, P. J. Slater (eds.): Domination in Graphs—Advanced Topics.Marcel Dekker, New York, 1998. MR 1605685
Reference: [6] S. M. Hedetniemi, S. T. Hedetniemi, D. F. Rall: Acyclic domination.Discrete Math. 222 (2000), 151–165. MR 1771395, 10.1016/S0012-365X(00)00012-1
Reference: [7] P. D. Vestergaard, B. Zelinka: Cut-vertices and domination in graphs.Math. Bohem. 120 (1995), 135–143. MR 1357598
.

Files

Files Size Format View
MathBohem_130-2005-1_7.pdf 292.4Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo