Broadcasts on Paths and Cycles

06/12/2019
by   Sabrina Bouchouika, et al.
0

A broadcast on a graph G=(V,E) is a function f: V⟶{0,...,diam(G)} such that f(v)≤ e_G(v) for every vertex v∈ V, wherediam(G) denotes the diameter of G and e_G(v) the eccentricity of v in G. The cost of such a broadcast is then the value ∑_v∈ Vf(v).Various types of broadcast functions on graphs have been considered in the literature, in relation with domination, irredundence, independence or packing, leading to the introduction of several broadcast numbers on graphs. In this paper, we determine these broadcast numbers for all paths and cycles, thus answering a question raised in [D. Ahmadi, G.H. Fricke, C. Schroeder, S.T. Hedetniemi and R.C. Laskar, Broadcast irredundance in graphs. Congr. Numer. 224 (2015), 17--31].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2021

On the Broadcast Independence Number of Circulant Graphs

An independent broadcast on a graph G is a function f: V ⟶{0,…, diam(G)}...
research
05/15/2020

Broadcast Dimension of Graphs

In this paper we initiate the study of broadcast dimension, a variant of...
research
03/26/2018

On the multipacking number of grid graphs

In 2001, Erwin introduced broadcast domination in graphs. It is a varian...
research
02/25/2023

Construction numbers: How to build a graph?

We count the number of ways to build paths, stars, cycles, and complete ...
research
12/09/2019

Resolving Conflicts and Electing Leaders

We review distributed algorithms for transmitting data (n real numbers) ...
research
02/08/2019

On the Broadcast Independence Number of Locally Uniform 2-Lobsters

Let G be a simple undirected graph.A broadcast on G isa function f : V(G...
research
02/25/2018

On the Broadcast Routing Problem

Given an undirected graph G = (V, E), and a vertex r∈ V, an r-acyclic or...

Please sign up or login with your details

Forgot password? Click here to reset