2018/09/21 by Misa Nakanishi, Nakanishi, Misa
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1809.08219
openalex publication_date 2018/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.