|
|||||
|
|
Limited packings in graphs |
|
| Authors: | Robert Gallant Bert L Hartnell Douglas F Rall |
| Institution: | a Memorial University of Newfoundland, Sir Wilfred Grenfell College, Corner Brook, Newfoundland, Canada b Saint Mary’s University, Halifax, Nova Scotia, Canada c Furman University, Greenville, SC, USA |
| Abstract: | We define a k-limited packing in a graph, which generalizes a 2-packing in a graph, and give several bounds on the size of a k-limited packing. One such bound involves the domination number of the graph, and here we show all trees attaining the bound can be built via a simple sequence of operations. We consider graphs where every maximal 2-limited packing is a maximum 2-limited packing, and characterize their structure in a number of cases. |
| Keywords: | Packings Domination |
| 本文献已被 ScienceDirect 等数据库收录！ | |