On the broadcast independence number of caterpillars

DOI10.1016/j.dam.2018.03.017zbMath1387.05174arXiv1612.08283OpenAlexW2963836251WikidataQ130069603 ScholiaQ130069603MaRDI QIDQ1752581

Isma Bouchemakh, Messaouda Ahmane, Eric Sopena

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.08283

zbMATH Keywords

independencedistancecaterpillarbroadcast independence

Mathematics Subject Classification ID

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

Related Items (5)

Algorithmic aspects of broadcast independence ⋮ Girth, minimum degree, independence, and broadcast independence ⋮ Broadcasts on paths and cycles ⋮ Broadcast Domination in Graphs ⋮ Relating broadcast independence and independence

Cites Work

• Broadcasts and domination in trees
• Optimal broadcast domination in polynomial time
• Radial trees
• On the broadcast independence number of grid graph
• Unsolved algorithmic problems on trees
• Broadcasts in graphs
• A linear‐time algorithm for broadcast domination in a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the broadcast independence number of caterpillars