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.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1048,
author = {Mieczys\l aw Borowiecki and Danuta Michalak and El\.zbieta Sidorowicz},
title = {Generalized domination, independence and irredudance in graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {17},
year = {1997},
pages = {147-153},
zbl = {0904.05045},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1048}
}
Mieczysław Borowiecki; Danuta Michalak; Elżbieta Sidorowicz. Generalized domination, independence and irredudance in graphs. Discussiones Mathematicae Graph Theory, Tome 17 (1997) pp. 147-153. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1048/
[000] [1] M. Borowiecki and P. Mihók, Hereditary Properties of Graphs, in: Advances in Graph Theory (Vishwa Inter. Publications, 1991) 41-68.
[001] [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. | Zbl 0305.05114
[002] [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. | Zbl 0393.05044
[003] [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). | Zbl 0411.68039
[004] [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. | Zbl 0709.05029
[005] [6] O. Ore, Theory of Graphs (Amer. Math. Soc. Colloq. Publ. 38, Providence, R. I., 1962).