A note on bounds for the broadcast domination number of graphs
From MaRDI portal
Publication:6130225
DOI10.1016/J.DAM.2024.02.010MaRDI QIDQ6130225
Srinivasa Rao Kola, Unnamed Author
Publication date: 2 April 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
regular graphgeneralized Petersen graphcirculant graphdominating broadcastbroadcast domination number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dominating broadcast labeling in Cartesian products of graphs
- Broadcasts and domination in trees
- A note on the k-domination number of a graph
- Vertex domination of generalized Petersen graphs
- Radial trees
- Relations between packing and covering numbers of a tree
- Packing in trees
- Broadcasts in graphs
- On Domination Number of 4-Regular Graphs
- An upper bound for domination number of 5-regular graphs
- Paths, Stars and the Number Three
- Broadcast Domination in Tori
This page was built for publication: A note on bounds for the broadcast domination number of graphs