Seyed Reza Musawi
Faculty of Mathematical Sciences, Shahrood University of Technology, P.O. Box 36199-9516, Shahrood, Iran & Department of Mathematics, University of Tafresh, Tafresh, Iran

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

On the distance domination number of bipartite graphs Doost Ali Mojdeh; Seyed Reza Musawi; Esmaeil Nazari
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 8, No 2 (2020): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2020.8.2.11

Abstract

‎A subset D ⊆ V(G) is called a k-distance dominating set of G if every vertex in V(G)-D is within distance k from some vertex of D‎. ‎The minimum cardinality among all k-distance dominating sets of G is called the k-distance domination number of G. ‎In this note we give upper bounds on the k-distance domination number of a connected bipartite graph‎, ‎and improve some results have been given like Theorems 2.1 and 2.7 in [Tian and Xu‎, ‎A note on distance domination of graphs‎, ‎Australasian Journal of Combinatorics‎, ‎43 (2009)‎, ‎181-190]‎.