The multiple originator broadcasting problem in graphs

  • Authors:

  • Ma-Lian Chia;David Kuo;Mei-Feng Tung

  • Affiliations:

  • Department of Applied Mathematics, National Dong Hwa University, Hualien 974, Taiwan;Department of Applied Mathematics, National Dong Hwa University, Hualien 974, Taiwan;Department of Applied Mathematics, National Dong Hwa University, Hualien 974, Taiwan

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2007

Quantified Score

Hi-index 0.05

Visualization

Abstract

Given a graph G and a vertex subset S of V(G), the broadcasting time with respect toS, denoted by b(G,S), is the minimum broadcasting time when using S as the broadcasting set. And the k-broadcasting number, denoted by b"k(G), is defined by b"k(G)=min{b(G,S)|S@?V(G),|S|=k}. Given a graph G and two vertex subsets S, S^' of V(G), define d(v,S)=min"u"@?"Sd(v,u), d(S,S^')=min{d(u,v)|u@?S, v@?S^'}, and d(G,S)=max"v"@?"V"("G")d(v,S) for all v@?V(G). For all k, 1=