Binary Stretch Embedding of Weighted Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913264661692416 |
|---|---|
| author | Ebrahimi, Javad B. Bonab, Mehri Oghbaei |
| author_facet | Ebrahimi, Javad B. Bonab, Mehri Oghbaei |
| contents | In this paper, we introduce and study the problem of \textit{binary stretch embedding} of edge-weighted graph. This problem is closely related to the well-known \textit{addressing problem} of Graham and Pollak. Addressing problem is the problem of assigning the shortest possible length strings (called ``addresses") over the alphabet $\{0,1,*\}$ to the vertices of an input graph $G$ with the following property. For every pair $u,v$ of vertices, the number of positions in which one of their addresses is $1$, and the other is $0$ is exactly equal to the distance of $u,v$ in graph $G$. When the addresses do not contain the symbol $*$, the problem is called \textit{isometric hypercube embedding}. As far as we know, the isometric hypercube embedding was introduced by Firsov in 1965. It is known that such addresses do not exist for general graphs.
Inspired by the addressing problem, in this paper, we introduce the \textit{binary stretch embedding problem}, or BSEP for short, for the edge-weighted undirected graphs. We also argue how this problem is related to other graph embedding problems in the literature.
Using tools and techniques such as Hadamard codes and the theory of linear programming, several upper and lower bounds as well as exact solutions for certain classes of graphs will be discovered.
As an application of the results in this paper, we derive improved upper bounds or exact values for the maximum size of Lee metric codes of certain parameters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_09311 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Binary Stretch Embedding of Weighted Graphs Ebrahimi, Javad B. Bonab, Mehri Oghbaei Discrete Mathematics Combinatorics G.2.2; G.2.3 In this paper, we introduce and study the problem of \textit{binary stretch embedding} of edge-weighted graph. This problem is closely related to the well-known \textit{addressing problem} of Graham and Pollak. Addressing problem is the problem of assigning the shortest possible length strings (called ``addresses") over the alphabet $\{0,1,*\}$ to the vertices of an input graph $G$ with the following property. For every pair $u,v$ of vertices, the number of positions in which one of their addresses is $1$, and the other is $0$ is exactly equal to the distance of $u,v$ in graph $G$. When the addresses do not contain the symbol $*$, the problem is called \textit{isometric hypercube embedding}. As far as we know, the isometric hypercube embedding was introduced by Firsov in 1965. It is known that such addresses do not exist for general graphs. Inspired by the addressing problem, in this paper, we introduce the \textit{binary stretch embedding problem}, or BSEP for short, for the edge-weighted undirected graphs. We also argue how this problem is related to other graph embedding problems in the literature. Using tools and techniques such as Hadamard codes and the theory of linear programming, several upper and lower bounds as well as exact solutions for certain classes of graphs will be discovered. As an application of the results in this paper, we derive improved upper bounds or exact values for the maximum size of Lee metric codes of certain parameters. |
| title | Binary Stretch Embedding of Weighted Graphs |
| topic | Discrete Mathematics Combinatorics G.2.2; G.2.3 |
| url | https://arxiv.org/abs/2403.09311 |