Name
Abstract | ||
|---|---|---|
For a graph G = (V, E), a set S subset of or equal to V is total irredundant if for every vertex upsilon is an element of V, the set N[upsilon] - N[S - {upsilon}] is not empty. The total irredundance number irt(G) is the minimum cardinality of a maximal total irredundant set of G. We study the structure of the class of graphs which do not have any total irredundant sets; these are called ir(t)(0)-graphs. Particular attention is given to the subclass of ir(t)(0)-graphs whose total irredundance number either does not change (stable) or always changes (unstable) under arbitrary single edge additions. Also studied are ir(t)(0)-graphs which are either stable or unstable under arbitrary single edge deletions. |
Year | Venue | Field |
|---|---|---|
2001 | ARS COMBINATORIA | Graph,Discrete mathematics,Combinatorics,Mathematics |
DocType | Volume | ISSN |
Journal | 61 | 0381-7032 |
Citations | PageRank | References |
1 | 0.48 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teresa W. Haynes | 1 | 774 | 94.22 |
| Stephen T. Hedetniemi | 2 | 1575 | 289.01 |
| Michael A. Henning | 3 | 1865 | 246.94 |
| Debra J. Knisley | 4 | 63 | 4.21 |