Name
Abstract | ||
|---|---|---|
A general characterization of connected graphs on n vertices having the maximum possible independent domination number of ¿n+2-2n¿ is given. This result leads to a structural characterization of such graphs in all but a small finite number of cases. For certain situations, one of which occurs when n is a perfect square, the extremal graphs have a particularly simple structure. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.disc.2003.06.011 | Discrete Mathematics |
Keywords | Field | DocType |
independent domination number,domination,extremal,total matching,connected graph,domination number | Discrete mathematics,Combinatorics,Indifference graph,Modular decomposition,Chordal graph,Domination analysis,Trapezoid graph,Mathematics,Metric dimension,Strong perfect graph theorem,Maximal independent set | Journal |
Volume | Issue | ISSN |
275 | 1 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.36 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert C. Brigham | 1 | 157 | 26.74 |
| Julie R. Carrington | 2 | 1 | 1.71 |
| Richard P. Vitray | 3 | 8 | 3.48 |