Unique paired vs edge-vertex minimum dominating sets in trees

We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.

Publication Details

Journal
ArXiv.org
Published
2025-03-15
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

Unique paired vs edge-vertex minimum dominating sets in trees

ArXiv.org
Advanced Graph Theory Research
article

Unique paired vs edge-vertex minimum dominating sets in trees

article en

Abstract

We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.

ArXiv.org
Openalex Percentile: Top 48%
Advanced Graph Theory Research
Open Access PDFOpenAlex
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.

Unique paired vs edge-vertex minimum dominating sets in trees · ArXiv.org (2025) | TGRS Research Map | TGRS