Name
Abstract | ||
|---|---|---|
The lower domination number of a digraph D, denoted by 7(D), is the least number of vertices in a set S, such that O[S] = V(D). A set S is irredundant if for all x is an element of S, vertical bar O[x] - 6[S - x]vertical bar >= 1. The lower irredundance number of a digraph, denoted ir(D), is the least number of vertices in a maximal irredundant set. A Gallai-type theorem has the form x(G) + y(G) = n, where x and y are parameters defined on G, and n is the number of vertices in the graph. We characterize. directed trees satisfying gamma(D) + Delta(+)(D) = n and directed trees satisfying ir(D) + Delta(+)(D) = n. |
Year | Venue | Keywords |
|---|---|---|
2006 | ARS COMBINATORIA | domination, irredundance, directed tree, Gallai theorem |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Mathematics | Journal | 81 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jason Albertson | 1 | 0 | 0.34 |
| Audene Harris | 2 | 0 | 0.34 |
| Larry J. Langley | 3 | 14 | 5.19 |
| Sarah K. Merz | 4 | 33 | 5.13 |