Lower boundary independent and hearing independent broadcasts in graphs

DOI10.7151/DMGT.2546MaRDI QIDQ6985848zbMATH OpenFDO

Authors J. I. Hoepner, Gary MacGillivray, Christina M. Mynhardt

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2546

zbMATH Keywords

broadcast dominationbroadcast independenceboundary independencehearing independence

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 6506585 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Boundary independent broadcasts in graphs
• Broadcast domination in graphs
• Broadcasts in graphs
• Comparing upper broadcast domination and boundary independence broadcast numbers of graphs
• Girth, minimum degree, independence, and broadcast independence
• Lower boundary independent broadcasts in trees
• Optimal broadcast domination in polynomial time
• Radial trees
• Relating broadcast independence and independence

This page was built for publication: Lower boundary independent and hearing independent broadcasts in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985848)