Broadcast independence number of oriented circulant graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914696936816640 |
|---|---|
| author | Laouar, Abdelamin Bouchemakh, Isma Sopena, Eric |
| author_facet | Laouar, Abdelamin Bouchemakh, Isma Sopena, Eric |
| contents | 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 independence number of unoriented circulant graphs \cite{LBS23}. In this paper, we are focused in the same parameter but of the class of oriented circulant graphs. An independent broadcast on an oriented graph $\overrightarrow{G}$ is a function $f: V\longrightarrow \{0,\ldots,\diam(\overrightarrow{G})\}$ such that $(i)$ $f(v)\leq e(v)$ for every vertex $v\in V(\overrightarrow{G})$, where $\diam(\overrightarrow{G})$ denotes the diameter of $\overrightarrow{G}$ and $e(v)$ the eccentricity of vertex $v$, and $(ii)$ $d_{\overrightarrow{G}}(u,v) > f(u)$ for every distinct vertices $u$, $v$ with $f(u)$, $f(v)>0$, where $d_{\overrightarrow{G}}(u,v)$ denotes the length of a shortest oriented path from $u$ to $v$. The broadcast independence number $β_b(\overrightarrow{G})$ of $\overrightarrow{G}$ is then the maximum value of $\sum_{v \in V} f(v)$, taken over all independent broadcasts on $\overrightarrow{G}$. The goal of this paper is to study the properties of independent broadcasts of oriented circulant graphs $\overrightarrow{C}(n;1,a)$, for any integers $n$ and $a$ with $n>|a|\geq 1$ and $a \notin \{1,n-1\}$. Then, we give some bounds and some exact values for the number $β_b(\overrightarrow{C}(n;1,a))$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_19234 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Broadcast independence number of oriented circulant graphs Laouar, Abdelamin Bouchemakh, Isma Sopena, Eric Combinatorics Discrete Mathematics 05C12, 05C69 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 independence number of unoriented circulant graphs \cite{LBS23}. In this paper, we are focused in the same parameter but of the class of oriented circulant graphs. An independent broadcast on an oriented graph $\overrightarrow{G}$ is a function $f: V\longrightarrow \{0,\ldots,\diam(\overrightarrow{G})\}$ such that $(i)$ $f(v)\leq e(v)$ for every vertex $v\in V(\overrightarrow{G})$, where $\diam(\overrightarrow{G})$ denotes the diameter of $\overrightarrow{G}$ and $e(v)$ the eccentricity of vertex $v$, and $(ii)$ $d_{\overrightarrow{G}}(u,v) > f(u)$ for every distinct vertices $u$, $v$ with $f(u)$, $f(v)>0$, where $d_{\overrightarrow{G}}(u,v)$ denotes the length of a shortest oriented path from $u$ to $v$. The broadcast independence number $β_b(\overrightarrow{G})$ of $\overrightarrow{G}$ is then the maximum value of $\sum_{v \in V} f(v)$, taken over all independent broadcasts on $\overrightarrow{G}$. The goal of this paper is to study the properties of independent broadcasts of oriented circulant graphs $\overrightarrow{C}(n;1,a)$, for any integers $n$ and $a$ with $n>|a|\geq 1$ and $a \notin \{1,n-1\}$. Then, we give some bounds and some exact values for the number $β_b(\overrightarrow{C}(n;1,a))$. |
| title | Broadcast independence number of oriented circulant graphs |
| topic | Combinatorics Discrete Mathematics 05C12, 05C69 |
| url | https://arxiv.org/abs/2402.19234 |