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

DOI10.1016/J.DAM.2021.04.020MaRDI QIDQ2028069zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 68339
• Domination number, independent domination number and 2-independence number in trees
• Domination and edge domination in trees
• scientific article; zbMATH DE number 989727
• An improved upper bound of edge-vertex domination number of a tree

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Extremal problems for roman domination
• Graph theory
• Graphs with large semipaired domination number
• Total domination in graphs

Cited in

(2)

• A continuous generalization of domination-like invariants
• Tree-edges deletion problems with bounded diameter obstruction sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028069)