Domination structure in 3-connected graphs
Combinatorics
2019-10-02 v3
Abstract
From a recent perspective, the structure of a 3-connected graph is studied in this paper. It stipulates the minimum dominating set of a 3-connected graph. Also, we count the number of structures, as a consequence, the upper bound is obtained. By it, the minimum dominating set of a 3-connected graph is determined in polynomial time.
Cite
@article{arxiv.1809.08219,
title = {Domination structure in 3-connected graphs},
author = {Misa Nakanishi},
journal= {arXiv preprint arXiv:1809.08219},
year = {2019}
}