Bounds on the vertex-edge domination number of a tree
From MaRDI portal
Publication:2450268
DOI10.1016/j.crma.2014.03.017zbMath1290.05118MaRDI 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
05C05: Trees
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Bounds on total edge domination number of a tree, Trees with vertex-edge roman domination number twice the domination number minus one, Total vertex-edge domination, Vertex-Edge Roman Domination, The outer-connected vertex edge domination number in Cartesian product graphs, Double vertex-edge domination, Vertex-edge domination in graphs, Vertex-edge domination in graphs, Vertex-edge domination in unit disk graphs, A lower bound on the total vertex-edge domination number of a tree, Unnamed Item, Unnamed Item, Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs, On \(k\)-vertex-edge domination of graph, Total outer connected vertex-edge domination, A note on independent vertex-edge domination in graphs, Double vertex-edge domination in graphs: complexity and algorithms, Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs, Results on vertex-edge and independent vertex-edge domination, Vertex-edge domination in cubic graphs, Dominating vertex covers: the vertex-edge domination problem, Vertices belonging to all or to no minimum vertex-edge dominating sets in trees, Total domination and vertex-edge domination in tres
Cites Work
