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.
图论是数学的一个分支,其中研究对象之间的成对关系。我的博士论文,由David R. Wood,引入并研究了一类新的图族,称为链接图,它概括了线图和路径图的概念。s-链接是长度为s的行走,使得连续的边不同。给定图G的s-链图是指G的s-链的顶点为G的s-链的图,如果两个顶点对应的s-链构成一个(s + 1)-链,则两个顶点相邻;或者等价地,一个对应的s-链可以一步分流到另一个对应的s-链。例如,G的1-链环图是G的线图。我们给出了一个特征的链接图,这导致算法的解决方案,他们的识别和确定问题,并意味着识别问题属于NP。此外,基于链图的一种递归结构,我们得到了关于链图的色数、Hadwiger数和同构群的一些结果。我们还得到了关于给定链图的原图的唯一性、树分解和优拟序的结果。
A bracket polynomial for graphs, IV. Undirected Euler circuits, graph-links and multiply marked graphs
在早期的工作中,我们介绍了图括号多项式的图与标记的顶点,动机的事实,即考夫曼括号的链接图D是由一个循环,标记版本的交织图相关联的有向欧拉系统的宇宙图D。在这里,我们扩展的图形括号的顶点可能携带不同种类的标记的图形,我们展示了如何多重标记的图形编码交错相对于任意(无向)欧拉系统。扩展后的机器将D. P. Ilyutko和V.O. Manturov [J.纽结理论分支18(2009),791-823].扩展括号的更大灵活性还允许比早期版本更简单的递归描述。