Preprint / Version 5

Formalization of the generalized domination structure in graphs with combinatorial analysis

##article.authors##

DOI:

https://doi.org/10.31224/5425

Keywords:

minimum dominating set, greedy algorithm, structure, NP-complete

Abstract

Following the paper (DOI: 10.61091/jcmcc124-48), we provide a technical paper. This paper addresses the minimum dominating set problem and generalizes the results for graphs with maximum degree 3 to general graphs. In addition, it complements the technical aspects of the results.

Downloads

Download data is not yet available.

Downloads

Posted

2025-09-22 — Updated on 2026-05-10

Versions

License

Copyright (c) 2025 Misa Nakanishi

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Version justification

fixed statements in the file