$(k,k',k'')$-domination in graphs
Abdollah Khodkar, Babak Samadi, H.R. Golmohammadi
TL;DR
This paper introduces a new graph domination parameter called (k,k',k'')-domination, providing bounds that improve upon existing results in graph theory.
Contribution
It generalizes several domination parameters and establishes tighter bounds, advancing the theoretical understanding of graph domination concepts.
Findings
Derived new bounds for (k,k',k'')-domination numbers
Unified various domination parameters under a single framework
Improved existing bounds in the literature
Abstract
We first introduce the concept of (k,k',k'')-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this parameter, which improve many well-known results in literatures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research