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

链图的原图

Original graphs of link graphs

Bin Jia

摘要:

设$\ell \geqslant 0$是一个整数,$G$是一个无环图. $G$的$\ell$链路是长度为$\ell$的行走,其中连续的边是不同的。我们确定一个$\ell$ -链接与其反向序列。$G$的$\ell$ -链路图$\mathbb{L}_\ell(G)$被定义为具有$G$的$\ell$ -链路的顶点,使得如果$\mathbb{L}_\ell(G)$的两个顶点的相应$\ell$ -链路是$G$的$(\ell + 1)$ -链路的初始和最终连续,则它们是相邻的.一个图$G$称为图$H$的一个$\ell$ -根,如果$\mathbb{L}_\ell(G) \cong H$ .例如,$\mathbb{L}_0(G) \cong G$。简单图的$1$ -链图是该图的线图.此外,设$H$是一个有限连通简单图。Whitney的同构定理(1932)指出,如果$H$有两个连接的非空单$1$ -根,则$H \cong K_3$和两个$1$ -根分别同构于$K_3$和$K_{1, 3}$。本文研究了有限图的$\ell$ -根。证明了每一个$\ell$ -根都是有限极小$\ell$ -根和有界直径树的某种组合.这就把对$\ell$ -根的研究转化为对有限极小$\ell$ -根的研究。作为Whitney同构定理的一个定性推广,我们从上面得到了有限图的最小$\ell$ -根的个数、大小、阶数和最大度.这一工作为我们以后的论文中解决$\ell$ -链接图的识别和判定问题奠定了基础。作为副产品,我们还研究了包括圈在内的一些特殊图的$\ell$ -根。Broersma和Hoede(1989)引入的路图也得到了类似的结果。如果$H$同构于$G$的$\ell$ -路图,则$G$是图$H$的$\ell$ -路根.我们从上面得到了有限图的最小$\ell$ -路根的个数、大小和阶.

英文摘要:

Let $\ell \geqslant 0$ be an integer, and $G$ be a graph without loops. An $\ell$-link of $G$ is a walk of length $\ell$ in which consecutive edges are different. We identify an $\ell$-link with its reverse sequence. The $\ell$-link graph $\mathbb{L}_\ell(G)$ of $G$ is defined to have vertices the $\ell$-links of $G$, such that two vertices of $\mathbb{L}_\ell(G)$ are adjacent if their corresponding $\ell$-links are the initial and final subsequences of an $(\ell + 1)$-link of $G$. A graph $G$ is called an $\ell$-root of a graph $H$ if $\mathbb{L}_\ell(G) \cong H$. For example, $\mathbb{L}_0(G) \cong G$. And the $1$-link graph of a simple graph is the line graph of that graph. Moreover, let $H$ be a finite connected simple graph. Whitney's isomorphism theorem (1932) states if $H$ has two connected nonnull simple $1$-roots, then $H \cong K_3$, and the two $1$-roots are isomorphic to $K_3$ and $K_{1, 3}$ respectively. This paper investigates the $\ell$-roots of finite graphs. We show that every $\ell$-root is a certain combination of a finite minimal $\ell$-root and trees of bounded diameter. This transfers the study of $\ell$-roots into that of finite minimal $\ell$-roots. As a qualitative generalisation of Whitney's isomorphism theorem, we bound from above the number, size, order and maximum degree of minimal $\ell$-roots of a finite graph. This work forms the basis for solving the recognition and determination problems for $\ell$-link graphs in our future papers. As a byproduct, we characterise the $\ell$-roots of some special graphs including cycles. Similar results are obtained for path graphs introduced by Broersma and Hoede (1989). $G$ is an $\ell$-path root of a graph $H$ if $H$ is isomorphic to the $\ell$-path graph of $G$. We bound from above the number, size and order of minimal $\ell$-path roots of a finite graph.

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

↑