Title of article
Broadcasts in graphs Original Research Article
Author/Authors
Jean E. Dunbar، نويسنده , , David J. Erwin، نويسنده , , Teresa W. Haynes، نويسنده , , Sandra M. Hedetniemi، نويسنده , , Stephen T. Hedetniemi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
17
From page
59
To page
75
Abstract
We say that a function image is a broadcast if for every vertex image, image, where image denotes the diameter of G and image denotes the eccentricity of image. The cost of a broadcast is the value image. 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 , Independent sets , Distance domination , Packings
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886180
Link To Document