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




Related Items

Independent domination in directed graphsAlgorithmic aspects of broadcast independenceOn the Complexity of Broadcast Domination and Multipacking in DigraphsDominating broadcast labeling in Cartesian products of graphsGirth, minimum degree, independence, and broadcast independence$k$-Efficient partitions of graphsOptimal broadcast domination in polynomial timeBroadcast domination and multipacking in strongly chordal graphsBroadcasts on paths and cyclesBroadcast domination of lexicographic and modular products of graphsA note on bounds for the broadcast domination number of graphsRelation between broadcast domination and multipacking numbers on chordal graphs2-limited broadcast domination in subcubic graphsGlobal dominating broadcast in graphsProjects in (t, r) Broadcast DominationNew bounds for the broadcast domination number of a graphOn the broadcast independence number of grid graphA decomposition approach for solving a broadcast domination network design problemOn the complexity of broadcast domination and multipacking In digraphsExponential domination in subcubic graphsDominating 2-broadcast in graphs: Complexity, bounds and extremal graphsDominating and irredundant broadcasts in graphsOn the broadcast independence number of caterpillarsBroadcasts and domination in treesA linear‐time algorithm for broadcast domination in a treeOn the broadcast domination number of permutation graphsBounds on the exponential domination number\(k\)-broadcast domination and \(k\)-multipackingBroadcast Domination in GraphsThe Private Neighbor ConceptRadial treesRelating broadcast independence and independenceUnnamed ItemBroadcast domination in subcubic graphsOn \((t,r)\) broadcast domination numbers of gridsBroadcast domination and multipacking: bounds and the integrality gapLIMITED DOMINATING BROADCAST IN GRAPHS2-limited dominating broadcasts on cubic graphs without induced 4-cycles



Cites Work