Domination structure in 3-connected graphs
From MaRDI portal
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.
This page was built for publication: Domination structure in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6307077)
