|
|||||
|
|
Broadcasts in graphs |
|
| Authors: | Jean E Dunbar David J Erwin |
| Institution: | a Converse College, Spartanburg, SC 29302, USA b Trinity College, Hartford, CT 06106, USA c East Tennessee State University, Johnson City, TN 37614, USA d Clemson University, Clemson, SC 29634-0974, USA |
| Abstract: | We say that a function f:V→{0,1,…,diam(G)} is a broadcast if for every vertex v∈V, f(v)?e(v), where diam(G) denotes the diameter of G and e(v) denotes the eccentricity of v. The cost of a broadcast is the value  . In this paper we introduce and study the minimum and maximum costs of several types of broadcasts in graphs, including dominating, independent and efficient broadcasts. |
| Keywords: | Domination Broadcasts Distance domination Independent sets Packings |
| 本文献已被 ScienceDirect 等数据库收录！ | |