Minimal acyclic dominating sets and cut-vertices

Vladimir D. Samodivkin

Mathematica Bohemica (2005)

  • Volume: 130, Issue: 1, page 81-88
  • ISSN: 0862-7959

Abstract

top
The paper studies minimal acyclic dominating sets, acyclic domination number and upper acyclic domination number in graphs having cut-vertices.

How to cite

top

Samodivkin, Vladimir D.. "Minimal acyclic dominating sets and cut-vertices." Mathematica Bohemica 130.1 (2005): 81-88. <http://eudml.org/doc/249585>.

@article{Samodivkin2005,
abstract = {The paper studies minimal acyclic dominating sets, acyclic domination number and upper acyclic domination number in graphs having cut-vertices.},
author = {Samodivkin, Vladimir D.},
journal = {Mathematica Bohemica},
keywords = {cut-vertex; dominating set; minimal acyclic dominating set; acyclic domination number; upper acyclic domination number; acyclic domination number},
language = {eng},
number = {1},
pages = {81-88},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Minimal acyclic dominating sets and cut-vertices},
url = {http://eudml.org/doc/249585},
volume = {130},
year = {2005},
}

TY - JOUR
AU - Samodivkin, Vladimir D.
TI - Minimal acyclic dominating sets and cut-vertices
JO - Mathematica Bohemica
PY - 2005
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 130
IS - 1
SP - 81
EP - 88
AB - The paper studies minimal acyclic dominating sets, acyclic domination number and upper acyclic domination number in graphs having cut-vertices.
LA - eng
KW - cut-vertex; dominating set; minimal acyclic dominating set; acyclic domination number; upper acyclic domination number; acyclic domination number
UR - http://eudml.org/doc/249585
ER -

References

top
  1. 10.1002/net.3230180304, Networks 18 (1988), 173–179. (1988) MR0953920DOI10.1002/net.3230180304
  2. Excellent trees, Bull. Inst. Comb. Appl. 34 (2002), 27–38. (2002) MR1880562
  3. Conditional graph theory IV: Dominating sets, Util. Math. 48 (1995), 179–192. (1995) MR1358599
  4. Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998. (1998) MR1605684
  5. Domination in Graphs—Advanced Topics, Marcel Dekker, New York, 1998. (1998) MR1605685
  6. 10.1016/S0012-365X(00)00012-1, Discrete Math. 222 (2000), 151–165. (2000) MR1771395DOI10.1016/S0012-365X(00)00012-1
  7. Cut-vertices and domination in graphs, Math. Bohem. 120 (1995), 135–143. (1995) MR1357598

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.