Total vertex-edge domination

DOI10.1080/00207160.2017.1343469zbMath1499.05447OpenAlexW2624999672MaRDI QIDQ5028563

Razika Boutrig, Mustapha Chellali

Publication date: 10 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2017.1343469

zbMATH Keywords

treetotal dominationvertex-edge dominationtotal vertex-edge domination

Mathematics Subject Classification ID

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

Related Items (12)

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Results on vertex-edge and independent vertex-edge domination ⋮ Total outer connected vertex-edge domination ⋮ Vertex-edge domination in cubic graphs ⋮ Algorithms and hardness results for edge total domination problem in graphs ⋮ Unnamed Item ⋮ Total edge–vertex domination ⋮ Vertex-edge domination in graphs ⋮ Vertex-edge domination in unit disk graphs ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs ⋮ A lower bound on the total vertex-edge domination number of a tree ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs

Cites Work

• Unnamed Item
• Bounds on the vertex-edge domination number of a tree
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Total domination in graphs
• Vertex-edge domination in graphs

This page was built for publication: Total vertex-edge domination