Broadcasts in graphs
From MaRDI portal
Publication:2581560
DOI10.1016/j.dam.2005.07.009zbMath1081.05084OpenAlexW1998431832MaRDI QIDQ2581560
David Erwin, Teresa W. Haynes, Stephen T. Hedetniemi, Jean E. Dunbar, Sandra M. Hedetniemi
Publication date: 10 January 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.07.009
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Independent domination in directed graphs, Algorithmic aspects of broadcast independence, On the Complexity of Broadcast Domination and Multipacking in Digraphs, Dominating broadcast labeling in Cartesian products of graphs, Girth, minimum degree, independence, and broadcast independence, $k$-Efficient partitions of graphs, Optimal broadcast domination in polynomial time, Broadcast domination and multipacking in strongly chordal graphs, Broadcasts on paths and cycles, Broadcast domination of lexicographic and modular products of graphs, A note on bounds for the broadcast domination number of graphs, Relation between broadcast domination and multipacking numbers on chordal graphs, 2-limited broadcast domination in subcubic graphs, Global dominating broadcast in graphs, Projects in (t, r) Broadcast Domination, New bounds for the broadcast domination number of a graph, On the broadcast independence number of grid graph, A decomposition approach for solving a broadcast domination network design problem, On the complexity of broadcast domination and multipacking In digraphs, Exponential domination in subcubic graphs, Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs, Dominating and irredundant broadcasts in graphs, On the broadcast independence number of caterpillars, Broadcasts and domination in trees, A linear‐time algorithm for broadcast domination in a tree, On the broadcast domination number of permutation graphs, Bounds on the exponential domination number, \(k\)-broadcast domination and \(k\)-multipacking, Broadcast Domination in Graphs, The Private Neighbor Concept, Radial trees, Relating broadcast independence and independence, Unnamed Item, Broadcast domination in subcubic graphs, On \((t,r)\) broadcast domination numbers of grids, Broadcast domination and multipacking: bounds and the integrality gap, LIMITED DOMINATING BROADCAST IN GRAPHS, 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
Cites Work
