Edge-vertex domination in trees

DOI10.1142/s1793830922500434zbMath1516.05173OpenAlexW4200602692MaRDI QIDQ6115749

Kijung Kim

Publication date: 13 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500434

zbMATH Keywords

treeedge-vertex dominating set

Mathematics Subject Classification ID

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

Cites Work

• An improved upper bound of edge-vertex domination number of a tree
• Improved budgeted connected domination and budgeted edge-vertex domination
• Total edge–vertex domination
• On trees with domination number equal to edge-vertex roman domination number
• Double vertex-edge domination
• A lower bound on the total vertex-edge domination number of a tree

This page was built for publication: Edge-vertex domination in trees