Lower boundary independent broadcasts in trees

DOI10.7151/DMGT.2434MaRDI QIDQ6985950zbMATH OpenFDO

Authors E. M. Marchessault, 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.2434

zbMATH Keywords

broadcast dominationbroadcast independenceboundary independence

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) 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 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2109329 (Why is no real title available?)
• Boundary independent broadcasts in graphs
• Broadcast domination in graphs
• Broadcasts in graphs
• Broadcasts on paths and cycles
• Dominating and irredundant broadcasts in graphs
• Girth, minimum degree, independence, and broadcast independence
• New bounds for the broadcast domination number of a graph
• On the broadcast independence number of caterpillars
• On the broadcast independence number of grid graph
• Optimal broadcast domination in polynomial time
• Radial trees
• Relating broadcast independence and independence

Cited in

(2)

• Lower boundary independent and hearing independent broadcasts in graphs
• Maximum boundary independent broadcasts in graphs and trees

This page was built for publication: Lower boundary independent broadcasts in trees

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