树的等周值的界
Bounds On Isoperimetric Values of Trees
摘要:
设G =(V,E)是一个有限的简单无向图.对于$S \subseteq V$,令$δ(S,G) = \{(u,v) \in E : u \in S \mbox {and} v \in V-S \}$为$S$的边边界。给定整数$i$,$1 \leq i \leq | V |$,令$i$处的$G$的边等周值定义为$b_e(i,G) = \min_{S \subseteq V; |S| = i} |δ(S,G)|$。$G$的边缘等周峰定义为$b_e(G)=\max_{1 \leq j \leq | V |} b_e(j,G)$。令$b_v(G)$表示以相应方式定义的顶点等周峰。\cite{OatYam}最近研究了完全$t$叉树顶点等周峰的下界问题。在本文中,我们提供的界限,改善\cite{OatYam}。我们表明,对于一个完整的二叉树的深度$d$(表示为$T_d^2$),$c_1d \leq b_e(T_d^2) \leq d$和$c_2d \leq b_v(T_d^2) \leq d$其中$c_1$,$c_2$是常数。对于一个完整的$t$-ary树的深度$d$(表示为$T_d^t$)和$d \geq c\log{t}$,其中$c$是一个常数,我们表明,$c_1\sqrt{t}d \leq b_e(T_d^t) \leq td$和$c_2\frac{d}{\sqrt{t}} \leq b_v(T_d^t) \leq d$,其中$c_1$,$c_2$是常数。我们的结果被推广到任意(根)树。
英文摘要:
Let G = (V,E) be a finite, simple and undirected graph. For $S \subseteq V$, let $δ(S,G) = \{(u,v) \in E : u \in S \mbox {and} v \in V-S \}$ be the edge boundary of $S$. Given an integer $i$, $1 \leq i \leq | V |$, let the edge isoperimetric value of $G$ at $i$ be defined as $b_e(i,G) = \min_{S \subseteq V; |S| = i} |δ(S,G)|$. The edge isoperimetric peak of $G$ is defined as $b_e(G)=\max_{1 \leq j \leq | V |} b_e(j,G)$. Let $b_v(G)$ denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete $t$-ary trees was recently considered in \cite{OatYam}. In this paper we provide bounds which improve those in \cite{OatYam}. We show that for a complete binary tree of depth $d$ (denoted as $T_d^2$), $c_1d \leq b_e(T_d^2) \leq d$ and $c_2d \leq b_v(T_d^2) \leq d$ where $c_1$, $c_2$ are constants. For a complete $t$-ary tree of depth $d$ (denoted as $T_d^t$) and $d \geq c\log{t}$ where $c$ is a constant, we show that $c_1\sqrt{t}d \leq b_e(T_d^t) \leq td$ and $c_2\frac{d}{\sqrt{t}} \leq b_v(T_d^t) \leq d$ where $c_1$, $c_2$ are constants. Our results are generalized to arbitrary(rooted) trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。