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

Riordan图I:结构性质

Riordan graphs I: Structural properties

Gi-Sang Cheon, Ji-Hwan Jung, Sergey Kitaev, Seyed Ahmad Mojallal

摘要:

本文利用Riordan矩阵理论引入Riordan图的概念。Riordan图是著名的Pascal图和Toeplitz图以及其他一些图族的广泛推广。Riordan图被证明具有许多有趣的(分形)性质,这些性质在创建具有某些所需特征的计算机网络或在设计计算图不变量值的算法时获得有用的信息时非常有用。本文主要研究由无限Riordan图得到的Riordan图族的结构性质,包括Riordan图族的基本分解定理和Riordan图族具有欧拉圈或哈密顿圈的条件.我们将在后续的论文中研究Riordan图的谱性质。

英文摘要:

In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other families of graphs. The Riordan graphs are proved to have a number of interesting (fractal) properties, which can be useful in creating computer networks with certain desirable features, or in obtaining useful information when designing algorithms to compute values of graph invariants. The main focus in this paper is the study of structural properties of families of Riordan graphs obtained from infinite Riordan graphs, which includes a fundamental decomposition theorem and certain conditions on Riordan graphs to have an Eulerian trail/cycle or a Hamiltonian cycle. We will study spectral properties of the Riordan graphs in a follow up paper.

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

↑