On restricted domination in graphs

Vladimir D. Samodivkin

Mathematica Slovaca (2007)

  • Volume: 57, Issue: 5, page [401]-406
  • ISSN: 0232-0525

How to cite

top

Samodivkin, Vladimir D.. "On restricted domination in graphs." Mathematica Slovaca 57.5 (2007): [401]-406. <http://eudml.org/doc/34659>.

@article{Samodivkin2007,
author = {Samodivkin, Vladimir D.},
journal = {Mathematica Slovaca},
keywords = {dominating set; restricted domination number},
language = {eng},
number = {5},
pages = {[401]-406},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {On restricted domination in graphs},
url = {http://eudml.org/doc/34659},
volume = {57},
year = {2007},
}

TY - JOUR
AU - Samodivkin, Vladimir D.
TI - On restricted domination in graphs
JO - Mathematica Slovaca
PY - 2007
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 57
IS - 5
SP - [401]
EP - 406
LA - eng
KW - dominating set; restricted domination number
UR - http://eudml.org/doc/34659
ER -

References

top
  1. ARUMUGAM S.-KALA R., Domsaturation number of a graph, Indian J. Pure Appl. Math. 33 (2002), 1671-1676. Zbl1066.05098MR1951019
  2. FLACH P.-VOLKMANN, L, Estimations for the domination number of a graph, Discrete Math. 80 (1990), 145-151. (1990) Zbl0699.05055MR1048457
  3. GAREY M. R.-JONSON D. S., Computers and Intractability: A Guide to the Theory of NP Completeness, Freeman, New York, 1979. (1979) Zbl0411.68039MR0519066
  4. HAYNES T. W.-HEDETNIEMI S. T.-SLATER P. J., Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998. (1998) Zbl0890.05002MR1605684
  5. Domination in Graphs: Advanced Topics, (T. W. Haуnes, S. T. Hedetniemi, P. J. Slater, eds.), Marcel Dekker, New York, 1998. (1998) Zbl0883.00011MR1605685
  6. HENNING M. A., Restricted domination in graphs, Discrete Math. 254 (2002), 175-189. Zbl1116.05057MR1910108
  7. McCUAIG W.-SHEPHERD B., Domination in graphs with minimum degree two, J. Graph Theory 13 (1989), 749-762. (1989) Zbl0708.05058MR1025896
  8. ORE O., Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Amer. Math. Soc, Providence, RI, 1962. (1962) Zbl0105.35401MR0150753
  9. PAYAN, C, Sur le nombre ďabsorption ďun graph simple, Cahiеrs du centrе ďеtudes de recherche operationelle 17 (1975), 307-317. (1975) MR0401551
  10. SAMPATHKUMAR E.-NEERLAGI P. S., Dominatгon and neighborhood critical, fixed, free and totally free points, Sankhyã Ser. A 54 (1992), 403-407. (1992) 
  11. SANCHIS L. A., Bounds related to domination in graphs with minimum degree two, J. Graph Thеоry 25 (1997), 139-152. (1997) Zbl0876.05047MR1448851

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.