A note on independent vertex-edge domination in graphs

DOI10.1016/j.disopt.2017.01.002zbMath1387.05180OpenAlexW2588496673MaRDI QIDQ1751226

Ting Gao, Xue-gang Chen, Kai Yin

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2017.01.002

zbMATH Keywords

counterexampleindependent vertex-edge domination numberupper non-enclaving number

Mathematics Subject Classification ID

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

Related Items (3)

Vertex-edge domination in cubic graphs ⋮ Vertex-edge domination in graphs ⋮ Vertex-edge domination in unit disk graphs

Cites Work

• Bounds on the vertex-edge domination number of a tree
• Total matchings and total coverings of graphs
• Vertex-edge domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on independent vertex-edge domination in graphs