Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs

DOI10.2298/AADM1801205CzbMath1488.05364arXiv1710.05953OpenAlexW2964097594WikidataQ129962611 ScholiaQ129962611MaRDI QIDQ5155707

No author found.

Publication date: 8 October 2021

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

dominationbroadcastNP-complete decision problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

2-limited broadcast domination in subcubic graphs ⋮ Broadcast Domination in Graphs ⋮ Broadcast domination in subcubic graphs ⋮ 2-limited dominating broadcasts on cubic graphs without induced 4-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Broadcasts and domination in trees
• Optimal broadcast domination in polynomial time
• Radial trees
• Existence of dominating cycles and paths
• Graphs with only caterpillars as spanning trees
• Broadcasts in graphs
• LIMITED DOMINATING BROADCAST IN GRAPHS
• Minimum Degree and Dominating Paths
• Existence of Δλ-cycles and Δλ-paths
• Linear-time computation of optimal subgraphs of decomposable graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs