Formalization of the generalized domination structure in graphs with combinatorial analysis

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.

Authors

Misa Nakanishi (ORCID: https://orcid.org/0000-0001-7848-4613)

Institutions

Barro Colorado Island (PA)

Publication Details

Published: 2025-09-22
DOI: https://doi.org/10.31224/5425
Primary Topic: Advanced Graph Theory Research
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Formalization of the generalized domination structure in graphs with combinatorial analysis

Misa Nakanishi

Sep 22, 2025

Advanced Graph Theory Research

article

Formalization of the generalized domination structure in graphs with combinatorial analysis

Misa Nakanishi

September 22, 2025article en

Abstract

Barro Colorado Island (PA)

Openalex Percentile: Top 73%

Advanced Graph Theory Research

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Formalization of the generalized domination structure in graphs with combinatorial analysis — Misa Nakanishi · (2025) | TGRS Research Map | TGRS