Name
Abstract | ||
|---|---|---|
A set S of vertices in a graph G is called a total irredundant set if, for each vertex υ in G, υ or one of its neighbors has no neighbor in S - {υ}. We investigate the minimum and maximum cardinalities of maximal total irredundant sets. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(00)00459-3 | Discrete Mathematics |
Keywords | Field | DocType |
total irredundance,domination,irredundance,maximal total irredundant set,total irredundant,graph g,total domination,maximum cardinalities | Monotonic function,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Cardinal number,Upper and lower bounds,Cardinality,Triangulation (social science),Regular graph,Mathematics | Journal |
Volume | Issue | ISSN |
256 | 1-2 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.54 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Odile Favaron | 1 | 484 | 60.59 |
| Teresa W. Haynes | 2 | 774 | 94.22 |
| Stephen T. Hedetniemi | 3 | 1575 | 289.01 |
| Michael A. Henning | 4 | 1865 | 246.94 |
| Debra J. Knisley | 5 | 63 | 4.21 |