Name
Abstract | ||
|---|---|---|
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 dom- inating 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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.7151/dmgt.1228 | Discussiones Mathematicae Graph Theory |
Keywords | Field | DocType |
independence | Discrete mathematics,Combinatorics,Hereditary property,Mathematics | Journal |
Volume | Issue | Citations |
24 | 2 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wayne Goddard | 1 | 115 | 15.40 |
| Teresa W. Haynes | 2 | 774 | 94.22 |
| Debra J. Knisley | 3 | 63 | 4.21 |