Broadcasts in graphs: diametrical trees
From MaRDI portal
Abstract: A dominating broadcast on a graph G with vertex set V is a function f that maps V to {0,1,...,diam(G)} such that f(v) does not exceed e(v) (the eccentricity of v) for all vertices v, and each vertex u is at distance at most f(v) from a vertex v with positive f(v). The upper broadcast domination number of G is {Gamma}_{b}(G), which equals the maximum of the sum of the function values f(v), the maximum being taken over all minimal dominating broadcasts f on G. As shown by Erwin in [D. Erwin, Cost domination in graphs, Doctoral dissertation, Western Michigan University, 2001], {Gamma}_{b}(G) is bounded below by diam(G) for any graph G. We investigate trees whose upper broadcast domination number equal their diameter and, among more general results, characterize caterpillars with this property.
Recommendations
Cited in
(16)- Radial trees
- On the broadcast independence number of caterpillars
- Broadcasts on paths and cycles
- Diametral broadcast graphs
- A class of trees with equal broadcast and domination numbers
- Broadcast domination in graphs
- scientific article; zbMATH DE number 1750102 (Why is no real title available?)
- scientific article; zbMATH DE number 6843211 (Why is no real title available?)
- More trees with equal broadcast and domination numbers
- On the upper broadcast domination number.
- Broadcasts and domination in trees
- Uniquely radial trees
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- Broadcast domination in line graphs of trees.
- Upper broadcast domination number of caterpillars with no trunks
- On the broadcast independence number of locally uniform 2-lobsters
This page was built for publication: Broadcasts in graphs: diametrical trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595654)
