arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1001.3053cs.ITmath.COmath.IT
收藏

赋权图的分数色数的上界

On some upper bounds on the fractional chromatic number of weighted graphs

Ashwin Ganesan

摘要:

给定一个加权图$G_\bx$,其中$(x(v): v \in V)$是分配给G的顶点的非负实值权重,令$B(G_\bx)$是加权图$G_\bx$的分数色数的上界;因此$χ_f(G_\bx) \le B(G_\bx)$。为了研究最坏情况下的性能的上限$B$,我们研究了图不变量$$β(G) = \sup_{\bx \ne 0} \frac{B(G_\bx)}{χ_f(G_\bx)}.$$ \noindent这个不变量检查各种上界$B$的分数色数。在一些重要的情况下,这个图的不变量被证明是有关的最大的明星在图中的子图的大小。这个问题出现在分布式系统和无线网络中的资源估计领域,这里提出的结果对分散式通信网络的设计和性能有影响。

英文摘要:

Given a weighted graph $G_\bx$, where $(x(v): v \in V)$ is a non-negative, real-valued weight assigned to the vertices of G, let $B(G_\bx)$ be an upper bound on the fractional chromatic number of the weighted graph $G_\bx$; so $χ_f(G_\bx) \le B(G_\bx)$. To investigate the worst-case performance of the upper bound $B$, we study the graph invariant $$β(G) = \sup_{\bx \ne 0} \frac{B(G_\bx)}{χ_f(G_\bx)}.$$ \noindent This invariant is examined for various upper bounds $B$ on the fractional chromatic number. In some important cases, this graph invariant is shown to be related to the size of the largest star subgraph in the graph. This problem arises in the area of resource estimation in distributed systems and wireless networks; the results presented here have implications on the design and performance of decentralized communication networks.

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

↑