Vertex-edge domination in graphs
From MaRDI portal
Publication:5890654
DOI10.1007/S00010-015-0354-2zbMath1337.05080OpenAlexW2113764055MaRDI QIDQ5890654
Teresa W. Haynes, Mustapha Chellali, Stephen T. Hedetniemi, Razika Boutrig
Publication date: 18 May 2016
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: http://dlibrary.univ-boumerdes.dz:8080/handle/123456789/2370
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (26)
Vertex-Edge Roman Domination ⋮ Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination ⋮ The outer-connected vertex edge domination number in Cartesian product graphs ⋮ On \(ve\)-degrees and \(ev\)-degrees in graphs ⋮ Total vertex-edge domination in graphs: Complexity and algorithms ⋮ 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 ⋮ Improved budgeted connected domination and budgeted edge-vertex domination ⋮ 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 ⋮ Unnamed Item ⋮ Double vertex-edge domination in graphs: complexity and algorithms ⋮ 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
Cites Work
This page was built for publication: Vertex-edge domination in graphs
