Upper broadcast domination number of caterpillars with no trunks

DOI10.5614/EJGTA.2024.12.2.6MaRDI QIDQ6669817zbMATH OpenFDO

Authors Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena

Publication date 22 January 2025

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

Full work available at URL https://doi.org/10.5614/EJGTA.2024.12.2.6

zbMATH Keywords

broadcastcaterpillarsdominating broadcastupper dominating broadcast

Mathematics Subject Classification ID

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

Recommendations

• Broadcasts in graphs: diametrical trees
• scientific article; zbMATH DE number 5844281
• On the upper broadcast domination number.
• On the broadcast independence number of caterpillars
• More trees with equal broadcast and domination numbers

Cites work

• Broadcast domination in graph products of paths
• Broadcast domination in graphs
• Broadcast irredundance in graphs
• Broadcasts in graphs
• Broadcasts in graphs: diametrical trees
• Broadcasts on paths and cycles
• Comparing upper broadcast domination and boundary independence broadcast numbers of graphs
• Dominating and irredundant broadcasts in graphs
• scientific article; zbMATH DE number 5844281 (Why is no real title available?)
• scientific article; zbMATH DE number 2109329 (Why is no real title available?)
• On the broadcast independence number of caterpillars
• On the broadcast independence number of circulant graphs
• On the upper broadcast domination number.

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)