A characterization of trees based on edge-deletion and its applications for domination-type invariants

DOI10.1016/J.DAM.2021.04.020zbMath1465.05127OpenAlexW3164148375MaRDI QIDQ2028069

Michitaka Furuya

Publication date: 31 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.020

zbMATH Keywords

dominationself dominationunavoidable tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

A continuous generalization of domination-like invariants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with large semipaired domination number
• Graph Theory
• Extremal Problems for Roman Domination
• Total domination in graphs

This page was built for publication: A characterization of trees based on edge-deletion and its applications for domination-type invariants