arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.05930math.CO
收藏

图及其补图的距离真连通

Distance proper connection of graphs and their complements

Xueliang Li, Colton Magnant, Meiqin Wei, Xiaoyu Zhu

摘要:

设$G$是边着色连通图。$G$中的路径$P$被称为距离$\ell$ -适当路径,如果在$P$上没有两个相同颜色的边可以出现小于$\ell$的边。图$G$称为$(k,\ell)$ -真连通图,如果存在边染色使得$G$的每对不同顶点都由$G$中的$k$两两内点不交距离$\ell$ -真路连通.使$G$ $(k,\ell)$ -正确连接所需的最小颜色数称为$G$的$(k,\ell)$ -正确连接数,并由$pc_{k,\ell}(G)$表示。本文首先研究了$(1,2)$--$G$在$\overline G$的某些约束条件下的真联系数。然后,我们用$(1,2)$ -真联系数$n-1$或$n-2$刻画了阶$n$图.利用这个结果,我们研究了$(1,2)$ -真联系数的Nordhaus-Gaddum-型问题,证明了连通图$G$和$\overline{G}$的真联系数为$pc_{1,2}(G)+pc_{1,2}(\overline{G})\leq n+2$.等式成立当且仅当$G$或$\overline{G}$同构于双星。

英文摘要:

Let $G$ be an edge-colored connected graph. A path $P$ in $G$ is called a distance $\ell$-proper path if no two edges of the same color can appear with less than $\ell$ edges in between on $P$. The graph $G$ is called $(k,\ell)$-proper connected if there is an edge-coloring such that every pair of distinct vertices of $G$ are connected by $k$ pairwise internally vertex-disjoint distance $\ell$-proper paths in $G$. The minimum number of colors needed to make $G$ $(k,\ell)$-proper connected is called the $(k,\ell)$-proper connection number of $G$ and denoted by $pc_{k,\ell}(G)$. In this paper we first focus on the $(1,2)$-proper connection number of $G$ depending on some constraints of $\overline G$. Then, we characterize the graphs of order $n$ with $(1,2)$-proper connection number $n-1$ or $n-2$. Using this result, we investigate the Nordhaus-Gaddum-Type problem of $(1,2)$-proper connection number and prove that $pc_{1,2}(G)+pc_{1,2}(\overline{G})\leq n+2$ for connected graphs $G$ and $\overline{G}$. The equality holds if and only if $G$ or $\overline{G}$ is isomorphic to a double star.

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

↑