On the distance domination number of bipartite graphs

DOI10.5614/ejgta.2020.8.2.11zbMath1468.05215arXiv1805.01280OpenAlexW3095553836MaRDI QIDQ4958000

Seyed Reza Musawi, Doost Ali Mojdeh, Esmaeil Nazari

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

domination\(k\)-distance dominationconnected bipartite

Mathematics Subject Classification ID

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

Related Items (4)

Unique response strong Roman dominating functions of graphs ⋮ A survey on enhanced power graphs of finite groups ⋮ An algebraic approach to sets defining minimal dominating sets of regular graphs ⋮ Connected domination value in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient dominating sets in Cayley graphs.
• Distance domination and distance irredundance in graphs
• Distance paired domination numbers of graphs
• Domination number of the non-commuting graph of finite groups
• Total $k$-distance domination critical graphs

This page was built for publication: On the distance domination number of bipartite graphs