Geodesic
On restricted domination in graphs
Mathematica slovaca, Tome 57 (2007) no. 5, pp. 401-406
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C69 
@article{MASLO_2007_57_5_a0,
     author = {Samodivkin, Vladimir},
     title = {On restricted domination in graphs},
     journal = {Mathematica slovaca},
     pages = {401--406},
     year = {2007},
     volume = {57},
     number = {5},
     mrnumber = {2357250},
     zbl = {1164.05054},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_2007_57_5_a0/}
}
TY  - JOUR
AU  - Samodivkin, Vladimir
TI  - On restricted domination in graphs
JO  - Mathematica slovaca
PY  - 2007
SP  - 401
EP  - 406
VL  - 57
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/MASLO_2007_57_5_a0/
LA  - en
ID  - MASLO_2007_57_5_a0
ER  - 
%0 Journal Article
%A Samodivkin, Vladimir
%T On restricted domination in graphs
%J Mathematica slovaca
%D 2007
%P 401-406
%V 57
%N 5
%U http://geodesic.mathdoc.fr/item/MASLO_2007_57_5_a0/
%G en
%F MASLO_2007_57_5_a0
Samodivkin, Vladimir. On restricted domination in graphs. Mathematica slovaca, Tome 57 (2007) no. 5, pp. 401-406. http://geodesic.mathdoc.fr/item/MASLO_2007_57_5_a0/

[1] ARUMUGAM S.-KALA R.: Domsaturation number of a graph. Indian J. Pure Appl. Math. 33 (2002), 1671-1676. | MR | Zbl

[2] FLACH P.-VOLKMANN, L: Estimations for the domination number of a graph. Discrete Math. 80 (1990), 145-151. | MR | Zbl

[3] GAREY M. R.-JONSON D. S.: Computers and Intractability: A Guide to the Theory of NP Completeness. Freeman, New York, 1979. | MR | Zbl

[4] HAYNES T. W.-HEDETNIEMI S. T.-SLATER P. J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998. | MR | Zbl

[5] Domination in Graphs: Advanced Topics. (T. W. Haуnes, S. T. Hedetniemi, P. J. Slater, eds.), Marcel Dekker, New York, 1998. | MR | Zbl

[6] HENNING M. A.: Restricted domination in graphs. Discrete Math. 254 (2002), 175-189. | MR | Zbl

[7] McCUAIG W.-SHEPHERD B.: Domination in graphs with minimum degree two. J. Graph Theory 13 (1989), 749-762. | MR | Zbl

[8] ORE O.: Theory of Graphs. Amer. Math. Soc. Colloq. Publ. 38, Amer. Math. Soc, Providence, RI, 1962. | MR | Zbl

[9] PAYAN, C: Sur le nombre ďabsorption ďun graph simple. Cahiеrs du centrе ďеtudes de recherche operationelle 17 (1975), 307-317. | MR

[10] SAMPATHKUMAR E.-NEERLAGI P. S.: Dominatгon and neighborhood critical, fixed, free and totally free points. Sankhyã Ser. A 54 (1992), 403-407.

[11] SANCHIS L. A.: Bounds related to domination in graphs with minimum degree two. J. Graph Thеоry 25 (1997), 139-152. | MR | Zbl