- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 1 of 1 (0.089 seconds)| 1 |
Broadcasts in GraphsDunbar, Jean, Erwin, David J., Haynes, Teresa W., Hedetniemi, Sandra M., Hedetniemi, Stephen T. 01 January 2006 (has links)
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.
|
Page generated in 0.0926 seconds