arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.09256math.CO
收藏

树的无向光学指数

The Undirected Optical Indices of Trees

Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong

AI总结:

该研究针对树的全交换实例,推导出无向光学指数小于二分之三倍边转发指数的不等式,明确了树图中两类图论参数的定量关系。

摘要:

对于连通图$G$,实例$I$是一组顶点对,对应的路由$R$是为$I$中所有顶点对指定的路径集合。设$\u211c_I$为关于$I$的所有路由的集合。$G$关于$I$的无向光学指数是指最小整数$k$,使得对所有路由$R\in\u211c_I$,都存在映射$\phi:R\to\{1,2,\ldots,k\}$,满足若路径$P$和$P'$有公共边,则$\phi(P)\neq\phi(P')$。无向光学指数的一个自然下界是边转发指数,其定义为所有可能路由中最大边负载的最小值。设$w(G,I)$和$\pi(G,I)$分别表示关于$I$的无向光学指数和边转发指数。本文中,我们推导出对任意树$T$,不等式$w(T,I_A)<\frac{3}{2}\pi(T,I_A)$成立,其中$I_A:=\{\{x,y\}:\\,x,y\in V(T)\}$是全交换实例。

英文摘要:

For a connected graph $G$, an instance $I$ is a set of pairs of vertices and a corresponding routing $R$ is a set of paths specified for all vertex-pairs in $I$. Let $\mathfrak{R}_I$ be the collection of all routings with respect to $I$. The undirected optical index of $G$ with respect to $I$ refers to the minimum integer $k$ to guarantee the existence of a mapping $ϕ:R\to\{1,2,\ldots,k\}$, such that $ϕ(P)\neqϕ(P')$ if $P$ and $P'$ have common edge(s), over all routings $R\in\mathfrak{R}_I$. A natural lower bound of the undirected optical index is the edge-forwarding index, which is defined to be the minimum of the maximum edge-load over all possible routings. Let $w(G,I)$ and $π(G,I)$ denote the undirected optical index and edge-forwarding index with respect to $I$, respectively. In this paper, we derive the inequality $w(T,I_A)<\frac{3}{2}π(T,I_A)$ for any tree $T$, where $I_A:=\{\{x,y\}:\,x,y\in V(T)\}$ is the all-to-all instance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑