On the Broadcast Independence Number of Locally Uniform 2-Lobsters

02/08/2019
by   Messaouda Ahmane, et al.
0

Let G be a simple undirected graph.A broadcast on G isa function f : V(G) →N such that f(v)< e_G(v) holds for every vertex v of G, where e_G(v) denotes the eccentricity of v in G, that is, the maximum distance from v to any other vertex of G.The cost of f is the value cost(f)=∑_v∈ V(G)f(v).A broadcast f on G is independent if for every two distinct vertices u and v in G, d_G(u,v)>{f(u),f(v)},where d_G(u,v) denotes the distance between u and v in G.The broadcast independence number of G is then defined as the maximum cost of an independent broadcast on G.A caterpillar is a tree such that, after the removal of all leaf vertices, the remaining graph is a non-empty path.A lobster is a tree such that, after the removal of all leaf vertices, the remaining graph is a caterpillar.In [M. Ahmane, I. Bouchemakh and E. Sopena.On the Broadcast Independence Number of Caterpillars.Discrete Applied Mathematics, in press (2018)], we studied independent broadcasts of caterpillars.In this paper, carrying on with this line of research, we consider independent broadcasts of lobsters and give an explicit formula for the broadcast independence number of a family of lobsters called locally uniform 2-lobsters.

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
08/09/2023

Approximation algorithm for finding multipacking on Cactus

For a graph G = (V, E) with vertex set V and edge set E, a function f : ...
research
11/24/2018

On Independent Cliques and Linear Complementarity Problems

In recent work (Pandit and Kulkarni [Discrete Applied Mathematics, 244 (...
research
06/12/2019

Broadcasts on Paths and Cycles

A broadcast on a graph G=(V,E) is a function f: V⟶{0,...,diam(G)} such t...
research
03/26/2018

On the multipacking number of grid graphs

In 2001, Erwin introduced broadcast domination in graphs. It is a varian...
research
08/03/2020

On the Broadcast Dimension of a Graph

A function f:V(G)→ℤ^+ ∪{0} is a resolving broadcast of a graph G if, for...
research
01/02/2022

A Linear Algorithm for Computing Independence Polynomials of Trees

An independent set in a graph is a set of pairwise non-adjacent vertices...

Please sign up or login with your details

Forgot password? Click here to reset