Name
Title | ||
|---|---|---|
Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence |
Abstract | ||
|---|---|---|
For a sequence d of non-negative integers, let F ( d ) be the set of all forests whose degree sequence is d . We present closed formulas for γ max F ( d ) = max { γ ( F ) : F ¿ F ( d ) } and α min F ( d ) = min { α ( F ) : F ¿ F ( d ) } where γ ( F ) and α ( F ) are the domination number and the independence number of a forest F , respectively. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2016.01.040 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Degree sequence,Realization,Forest realization,Clique,Independent set,Dominating set | Integer,Discrete mathematics,Combinatorics,Independence number,Dominating set,Clique,Independent set,Degree (graph theory),Domination analysis,Mathematics | Journal |
Volume | Issue | ISSN |
206 | C | 0166-218X |
Citations | PageRank | References |
1 | 0.39 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Gentner | 1 | 22 | 4.46 |
| Michael A. Henning | 2 | 1865 | 246.94 |
| Dieter Rautenbach | 3 | 946 | 138.87 |