Upper broadcast domination number of caterpillars with no trunks
From MaRDI portal
Publication:6669817
DOI10.5614/EJGTA.2024.12.2.6MaRDI QIDQ6669817
Isma Bouchemakh, Éric Sopena, Sabrina Bouchouika
Publication date: 22 January 2025
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dominating and irredundant broadcasts in graphs
- On the broadcast independence number of caterpillars
- Broadcasts on paths and cycles
- Broadcasts in graphs
- Broadcast irredundance in graphs
- Broadcast domination in graph products of paths
- Broadcast Domination in Graphs
- Broadcasts in Graphs: Diametrical Trees
- On the broadcast independence number of circulant graphs
This page was built for publication: Upper broadcast domination number of caterpillars with no trunks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669817)
