On the Ratio of Shannon Numbers of Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909419613192192 |
|---|---|
| author | Alipour, Sharareh Gohari, Amin Taziki, Mehrshad |
| author_facet | Alipour, Sharareh Gohari, Amin Taziki, Mehrshad |
| contents | Let $Γ$ be a function that maps two arbitrary graphs $G$ and $H$ to a non-negative real number such that $$α(G^{\boxtimes n})\leq α(H^{\boxtimes n})Γ(G,H)^n$$ where $n$ is any natural number and $G^{\boxtimes n}$ is the strong product of $G$ with itself $n$ times. We establish the equivalence of two different approaches for finding such a function $Γ$. The common solution obtained through either approach is termed ``the relative fractional independence number of a graph $G$ with respect to another graph $H$". We show this function by $α^*(G|H)$ and discuss some of its properties. In particular, we show that $α^*(G|H)\geq \frac{X(G)}{X(H)} \geq \frac{1}{α^*(H|G)},$ where $X(G)$ can be the independence number, the Shannon capacity, the fractional independence number, the Lovász number, or the Schrijver's or Szegedy's variants of the Lovász number of a graph $G$. This inequality is the first explicit non-trivial upper bound on the ratio of the invariants of two arbitrary graphs, as mentioned earlier, which can also be used to obtain upper or lower bounds for these invariants. As explicit applications, we present new upper bounds for the ratio of the Shannon capacity of two Cayley graphs and compute new lower bounds on the Shannon capacity of certain Johnson graphs (yielding the exact value of their Haemers number). Moreover, we show that $α^*(G|H)$ can be used to present a stronger version of the well-known No-Homomorphism Lemma. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_06155 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On the Ratio of Shannon Numbers of Graphs Alipour, Sharareh Gohari, Amin Taziki, Mehrshad Combinatorics Information Theory Let $Γ$ be a function that maps two arbitrary graphs $G$ and $H$ to a non-negative real number such that $$α(G^{\boxtimes n})\leq α(H^{\boxtimes n})Γ(G,H)^n$$ where $n$ is any natural number and $G^{\boxtimes n}$ is the strong product of $G$ with itself $n$ times. We establish the equivalence of two different approaches for finding such a function $Γ$. The common solution obtained through either approach is termed ``the relative fractional independence number of a graph $G$ with respect to another graph $H$". We show this function by $α^*(G|H)$ and discuss some of its properties. In particular, we show that $α^*(G|H)\geq \frac{X(G)}{X(H)} \geq \frac{1}{α^*(H|G)},$ where $X(G)$ can be the independence number, the Shannon capacity, the fractional independence number, the Lovász number, or the Schrijver's or Szegedy's variants of the Lovász number of a graph $G$. This inequality is the first explicit non-trivial upper bound on the ratio of the invariants of two arbitrary graphs, as mentioned earlier, which can also be used to obtain upper or lower bounds for these invariants. As explicit applications, we present new upper bounds for the ratio of the Shannon capacity of two Cayley graphs and compute new lower bounds on the Shannon capacity of certain Johnson graphs (yielding the exact value of their Haemers number). Moreover, we show that $α^*(G|H)$ can be used to present a stronger version of the well-known No-Homomorphism Lemma. |
| title | On the Ratio of Shannon Numbers of Graphs |
| topic | Combinatorics Information Theory |
| url | https://arxiv.org/abs/2307.06155 |