论文信息 - Generalized domination, independence and irredudance in graphs

Generalized domination, independence and irredudance in graphs

The purpose of this paper is to present some basic properties of P-dominating, P-independent, and P-irredundant sets in graphs which generalize well-known properties of dominating, independent and irredundant sets, respectively.

Mieczyslaw Borowiecki | Elzbieta Sidorowicz | Danuta Michalak

[1] Fred B. Schneider,et al. A Theory of Graphs , 1993 .

[2] G. R. Vijayakumar,et al. Hereditary properties of graphs , 1999, Discret. Math..

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Michael A. Henning,et al. Bounds on a generalized domination parameter , 1990 .

[5] E. Cockayne,et al. Properties of Hereditary Hypergraphs and Middle Graphs , 1978, Canadian Mathematical Bulletin.