相关论文: Dominating and Irredundant Broadcasts in Graphs

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…

A broadcast on a nontrivial connected graph G with vertex set V is a function f from V to {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all v in V. The weight of f is the sum of the function values taken over V. A…

For a graph $G$, a function $f:V(G) \to \{0,1,2\}$ is called a $2$-limited dominating broadcast on $G$ if for every vertex $u$, there exists a vertex $v$ such that $f(v)>0$ and the distance between $u$ and $v$ in $G$ is at most $f(v)$. The…

A broadcast on a graph $G=(V,E)$ is a function $f: V\longrightarrow \{0,\ldots,\operatorname{diam}(G)\}$ such that $f(v)\leq e\_G(v)$ for every vertex $v\in V$, where$\operatorname{diam}(G)$ denotes the diameter of $G$ and $e\_G(v)$ the…

A broadcast on a graph $G=(V,E)$ is a function $f:V \rightarrow \{0,1, \ldots, \text{diam}(G)\}$ satisfying $f(v) \leq e(v)$ for all $v \in V$, where $e(v)$ denotes the eccentricity of $v$ and $\text{diam}(G)$ denotes the diameter of $G$.…

A broadcast on a nontrivial connected graph G is a function f from the vertices of G to the non-negative integers such that f(v) does not exceed e(v) (the eccentricity of v) for each vertex v. If G is disconnected, we define a broadcast on…

For a graph $ G = (V, E) $ with a vertex set $ V $ and an edge set $ E $, a function $ f : V \rightarrow \{0, 1, 2, . . . , diam(G)\} $ is called a \emph{broadcast} on $ G $. For each vertex $ u \in V $, if there exists a vertex $ v $ in $…

A broadcast on a connected graph $G=(V,E)$ is a function $f:V\rightarrow \{0,1,\dots,\operatorname{diam}(G)\}$ such that $f(v)\leq e(v)$ (the eccentricity of $v$) for all $v\in V$ if $|V|\geq2$, and $f(v)=1$ if $V=\{v\}$. The cost of $f$ is…

An independent broadcast on a graph $G$ is a function $f: V \longrightarrow \{0,\ldots,{\rm diam}(G)\}$ such that $(i)$ $f(v)\leq e(v)$ for every vertex $v\in V(G)$, where $\operatorname{diam}(G)$ denotes the diameter of $G$ and $e(v)$ the…

An independent broadcast on a connected graph $G$ is a function $f:V(G)\to \mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex…

A dominating set of a graph $G$ is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of $G$ is the order of a minimum dominating set of $G$. The $(t,r)$ broadcast domination is a…

Let $G=(V,E)$ be a graph and $t,r$ be positive integers. The \emph{signal} that a tower vertex $T$ of signal strength $t$ supplies to a vertex $v$ is defined as $sig(T,v)=max(t-dist(T,v),0),$ where $dist(T,v)$ denotes the distance between…

An independent broadcast on a connected graph $G$ is a function $f:V(G)\to \mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex…

The dual concepts of coverings and packings are well studied in graph theory. Coverings of graphs with balls of radius one and packings of vertices with pairwise distances at least two are the well-known concepts of domination and…

Let $G=( V(G), E(G) )$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. We say a subset $D$ of $V(G)$ dominates $G$ if every vertex in $V \setminus D$ is adjacent to a vertex in $D$. A generalization of this concept is…

A broadcast on a connected graph G with vertex set V(G) is a function $f:V(G)\rightarrow \{0, 1, ..., \text{diam}(G)\}$ such that $f(v)\leq e(v)$ (the eccentricity of $v$) for all $v\in V$. A vertex $v$ is said to be broadcasting if…

An independent broadcast on a connected graph $G$ is a function $f:V(G)\to \mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex…

A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus D$ is adjacent to a vertex in $D$. The cardinality of a smallest dominating set of $D$ is called the domination number of $G$ and is denoted…

Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and classical…

In 2001, D. Erwin \cite{Erw01} introduced in his Ph.D. dissertation the notion of broadcast independence in unoriented graphs. Since then, some results but not many, are published on this notion, including research work on the broadcast…