A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices

DOI10.7494/OpMath.2020.40.3.375zbMath1437.05181arXiv1912.03919MaRDI QIDQ5106724

Narges Ghareghani, Iztok Peterin, Pouyeh Sharifani

Publication date: 22 April 2020

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.03919

zbMATH Keywords

bipartite graphsdomination\([1, k\)-domination number]\([1, k\)-total domination number]

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• \((1, j)\)-set problem in graphs
• \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms]
• When an optimal dominating set with given constraints exists
• \([1,2\)-sets in graphs]
• Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs

This page was built for publication: A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices