Abstract
For a positive integer r, a distance-r independent set in an undirected graph G is a set I⊆V(G) of vertices pairwise at distance greater than r, while a distance-r dominating set is a set D⊆V(G) such that every vertex of the graph is within distance at most r from a vertex from D. We study the duality between the maximum size of a distance-2r independent set and the minimum size of a distance-r dominating set in nowhere dense graph classes, as well as the kernelization complexity of the distance-r independent set problem on these graph classes. Specifically, we prove that the distance-r independent set problem admits an almost linear kernel on every nowhere dense graph class.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
