The \(k\) edge-vertex domination problem

DOI10.1007/978-3-031-49190-0_23MaRDI QIDQ6591483

Xingli Zhou, Peng Li, Zhiang Zhou

Publication date: 22 August 2024

zbMATH Keywords

treesdominationinterval graphsedge-vertex domination\(k\) edge-vertex domination

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to domination problems on interval graphs
• An improved upper bound of edge-vertex domination number of a tree
• Algorithmic aspects of semitotal domination in graphs
• Distribution centers in graphs
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
• Domination in Graphs Applied to Electric Power Networks
• On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs

This page was built for publication: The \(k\) edge-vertex domination problem