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 f(V)=∑v∈Vf(v). 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.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19407 |
| Date | 01 January 2006 |
| Creators | Dunbar, Jean, Erwin, David J., Haynes, Teresa W., Hedetniemi, Sandra M., Hedetniemi, Stephen T. |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0018 seconds