Geodesic
Generalized domination, independence and irredudance in graphs
Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 1, pp. 147-153.

Voir la notice de l'article provenant de la source Library of Science

The purpose of this paper is to present some basic properties of -dominating, -independent, and -irredundant sets in graphs which generalize well-known properties of dominating, independent and irredundant sets, respectively.
Keywords: hereditary property of graphs, generalized domination, independence and irredundance numbers 
@article{DMGT_1997_17_1_a11,
     author = {Borowiecki, Mieczys{\l}aw and Michalak, Danuta and Sidorowicz, El\.zbieta},
     title = {Generalized domination, independence and irredudance in graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {147--153},
     publisher = {mathdoc},
     volume = {17},
     number = {1},
     year = {1997},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a11/}
}
TY  - JOUR
AU  - Borowiecki, Mieczysław
AU  - Michalak, Danuta
AU  - Sidorowicz, Elżbieta
TI  - Generalized domination, independence and irredudance in graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1997
SP  - 147
EP  - 153
VL  - 17
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a11/
LA  - en
ID  - DMGT_1997_17_1_a11
ER  - 
%0 Journal Article
%A Borowiecki, Mieczysław
%A Michalak, Danuta
%A Sidorowicz, Elżbieta
%T Generalized domination, independence and irredudance in graphs
%J Discussiones Mathematicae. Graph Theory
%D 1997
%P 147-153
%V 17
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a11/
%G en
%F DMGT_1997_17_1_a11
Borowiecki, Mieczysław; Michalak, Danuta; Sidorowicz, Elżbieta. Generalized domination, independence and irredudance in graphs. Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 1, pp. 147-153. http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a11/

[1] M. Borowiecki and P. Mihók, Hereditary Properties of Graphs, in: Advances in Graph Theory (Vishwa Inter. Publications, 1991) 41-68.

[2] E.J. Cockayne and S.T. Hedetniemi, Independence graphs, in: Proc. 5th Southeast Conf. Combinatorics, Graph Theory and Computing, Utilitas Mathematica (Winnepeg, 1974) 471-491.

[3] E.J. Cockayne, S.T. Hedetniemi and D.J. Miller, Properties of hereditary hypergraphs and middle graphs, Canad. Math. Bull. 21 (1978) 461-468, doi: 10.4153/CMB-1978-079-5.

[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completness (W.H. Freeman, San Francisco, CA, 1979).

[5] M.A. Henning and H.C. Swart, Bounds on a generalized domination parameter, Quaestiones Math. 13 (1990) 237-253, doi: 10.1080/16073606.1990.9631615.

[6] O. Ore, Theory of Graphs (Amer. Math. Soc. Colloq. Publ. 38, Providence, R. I., 1962).