(1,2)-PDS in graphs with the small number of vertices of large degrees
We define and study a perfect \((1,2)\)-dominating set which is a special case of a \((1,2)\)-dominating set. We discuss the existence of a perfect \((1,2)\)-dominating set in graphs with at most two vertices of maximum degree. In particular, we present a complete solution if the maximum degree equals \(n-1\) or \(n-2\).
Authors
- Urszula Bednarz (ORCID: https://orcid.org/0000-0002-4856-9613)
- Mateusz Pirga (ORCID: https://orcid.org/0000-0002-9206-1825)
Publication Details
- Journal
- Opuscula Mathematica
- Published
- 2024-12-20
- DOI
- https://doi.org/10.7494/opmath.2025.45.1.53
- Citations
- 2
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.42