Bounds on the vertex-edge domination number of a tree
From MaRDI portal
Publication:2450268
DOI10.1016/j.crma.2014.03.017zbMath1290.05118OpenAlexW2051431590MaRDI QIDQ2450268
Balakrishna Krishnakumari, Marcin Krzywkowski, Yanamandram B. Venkatakrishnan
Publication date: 19 May 2014
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2014.03.017
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (26)
Vertex-Edge Roman Domination ⋮ The outer-connected vertex edge domination number in Cartesian product graphs ⋮ Results on vertex-edge and independent vertex-edge domination ⋮ On \(k\)-vertex-edge domination of graph ⋮ 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 ⋮ Total domination and vertex-edge domination in tres ⋮ Unnamed Item ⋮ Vertex-edge domination in graphs ⋮ Vertices belonging to all or to no minimum vertex-edge dominating sets in trees ⋮ A note on independent vertex-edge domination in graphs ⋮ Vertex-edge domination in unit disk graphs ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs ⋮ Unnamed Item ⋮ Double vertex-edge domination in graphs: complexity and algorithms ⋮ A lower bound on the total vertex-edge domination number of a tree ⋮ Bounds on total 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
Cites Work
This page was built for publication: Bounds on the vertex-edge domination number of a tree
