2018/02/10 by Jerzy Topp, Topp, Jerzy, Paweł Żyliński +1
Computer Science · Mathematics · #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C69
paper · pdf · doi:10.48550/arxiv.1802.03392
2 pages
arxiv created 2018/02/10 · openalex publication_date 2018/02/10 · arxiv updated 2018/02/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let γ(G) and β(G) denote the domination number and the covering number of a graph G, respectively. A connected non-trivial graph G is said to be γβ-perfect if γ(H)=β(H) for every non-trivial induced connected subgraph H of G. In this note we present an elementary proof of a characterization of the γβ-perfect graphs.