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

链接图的研究

A study of link graphs

Bin Jia

摘要:

图论是数学的一个分支,其中研究对象之间的成对关系。我的博士论文,由David R. Wood,引入并研究了一类新的图族,称为链接图,它概括了线图和路径图的概念。s-链接是长度为s的行走,使得连续的边不同。给定图G的s-链图是指G的s-链的顶点为G的s-链的图,如果两个顶点对应的s-链构成一个(s + 1)-链,则两个顶点相邻;或者等价地,一个对应的s-链可以一步分流到另一个对应的s-链。例如,G的1-链环图是G的线图。我们给出了一个特征的链接图,这导致算法的解决方案,他们的识别和确定问题,并意味着识别问题属于NP。此外,基于链图的一种递归结构,我们得到了关于链图的色数、Hadwiger数和同构群的一些结果。我们还得到了关于给定链图的原图的唯一性、树分解和优拟序的结果。

英文摘要:

Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the notions of line graphs and path graphs. An s-link is a walk of length s such that consecutive edges are different. The s-link graph of a given graph G is the graph with vertices the s-links of G, and two vertices are adjacent if their corresponding s-links form an (s + 1)-link; Or equivalently, one corresponding s-link can be shunted to the other in one step. For example, the 1-link graph of G is the line graph of G. We give a characterisation for link graphs, which leads to algorithmic solutions to their recognition and determination problems, and implies that the recognition problem belongs to NP. Moreover, based on a recursive structure of linkgraphs, we obtain results about the chromatic number, Hadwiger number and isomorphism group of link graphs. We also obtain results about the uniqueness, tree-decomposition and better-quasi-ordering of the original graphs of a given link graph.

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

↑