Vertex-edge domination in graphs
From MaRDI portal
Publication:5919557
DOI10.1007/s00010-018-0609-9zbMath1416.05218OpenAlexW2896286920MaRDI QIDQ5919557
Publication date: 26 July 2019
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-018-0609-9
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Results on vertex-edge and independent vertex-edge domination ⋮ On \(k\)-vertex-edge domination of graph ⋮ Vertex-edge domination in cubic graphs ⋮ Vertex-edge domination in unit disk graphs ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs ⋮ Double vertex-edge domination in graphs: complexity and algorithms ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An annotated bibliography on guaranteed graph searching
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
- A note on independent vertex-edge domination in graphs
- Covering grids and orthogonal polygons with periscope guards
- On \(ve\)-degrees and \(ev\)-degrees in graphs
- Bounds on the vertex-edge domination number of a tree
- Complementary nil vertex edge dominating sets
- Total vertex-edge domination
- Protecting a graph with mobile guards
- Double vertex-edge domination
- Vertex-edge domination in graphs
This page was built for publication: Vertex-edge domination in graphs