Hereditary domination and independence parameters | Zendy

Wayne Goddard | Zendy; Teresa W. Haynes | Zendy; Debra Knisley | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hereditary domination and independence parameters

Author(s) -

Wayne Goddard,

Teresa W. Haynes,

Debra Knisley

Publication year - 2004

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1228

Subject(s) - mathematics , independence (probability theory) , combinatorics , independence number , statistics , graph

For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for arbitrary properties P that are closed under disjoint unions and subgraphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research