A lower bound on the total vertex-edge domination number of a tree

DOI10.1142/S1793830920500913zbMath1458.05206OpenAlexW3042819172MaRDI QIDQ5859501

No author found.

Publication date: 16 April 2021

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

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

zbMATH Keywords

treesvertex-edge dominating settotal vertex-edge dominating set

Mathematics Subject Classification ID

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

Related Items (2)

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Edge-vertex domination in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the vertex-edge domination number of a tree
• Total vertex-edge domination
• Vertex-edge domination in graphs
• Vertex-edge domination in graphs

This page was built for publication: A lower bound on the total vertex-edge domination number of a tree