Name
Abstract | ||
|---|---|---|
We characterize the graphs for which the independence number equals the packing number. As a consequence we obtain simple structural descriptions of the graphs for which (i) the distance- k -packing number equals the distance- 2 k -packing number, and (ii) the distance- k -matching number equals the distance- 2 k -matching number. This last result considerably simplifies and extends previous results of Cameron and Walker (2005). For positive integers k 1 and k 2 with k 1 |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.disc.2015.06.003 | Discrete Mathematics |
Keywords | Field | DocType |
independent set,matching | Integer,Discrete mathematics,Graph,Combinatorics,Independence number,Independent set,Mathematics | Journal |
Volume | Issue | ISSN |
338 | 12 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Felix Joos | 1 | 37 | 11.20 |
| Dieter Rautenbach | 2 | 946 | 138.87 |