scientific article

zbMath1207.05144MaRDI QIDQ3059032

Teresa W. Haynes, Jason Lewis, Stephen T. Hedetniemi, Gerd H. Fricke

Publication date: 8 December 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dominationvertex-edge dominationtotal covering

Mathematics Subject Classification ID

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

Related Items (27)

Vertex-Edge Roman Domination ⋮ On trees with total domination number equal to edge-vertex domination number plus one ⋮ The outer-connected vertex edge domination number in Cartesian product graphs ⋮ On \(ve\)-degrees and \(ev\)-degrees in graphs ⋮ Results on vertex-edge and independent vertex-edge domination ⋮ \( M_{v e}\)-polynomial of cog-special graphs and types of fan graphs ⋮ Total outer connected vertex-edge domination ⋮ Vertex-edge domination in cubic graphs ⋮ Double vertex-edge domination ⋮ Dominating vertex covers: the vertex-edge domination problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Vertex-edge domination in graphs ⋮ Unnamed Item ⋮ Bounds on the vertex-edge domination number of a tree ⋮ Total domination and vertex-edge domination in tres ⋮ Unnamed Item ⋮ Vertex-edge domination in graphs ⋮ A note on independent vertex-edge domination in graphs ⋮ Vertex-edge domination in unit disk graphs ⋮ Unnamed Item ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs ⋮ Unnamed Item ⋮ A lower bound on the total vertex-edge domination number of a tree ⋮ Trees with vertex-edge roman domination number twice the domination number minus one ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs ⋮ Total vertex-edge domination

This page was built for publication: