Riordan graphs I : structural properties

Cheon, Gi-Sang and Jung, Ji-Hwan and Kitaev, Sergey and Mojallal, Seyed Ahmad (2019) Riordan graphs I : structural properties. Linear Algebra and its Applications, 579. pp. 89-135. ISSN 0024-3795

[img] Text (Cheon-etal-LAA-2019-Riordan-graphs-I-structural-properties)
Cheon_etal_LAA_2019_Riordan_graphs_I_structural_properties.pdf
Accepted Author Manuscript
Restricted to Repository staff only until 30 May 2020.
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (347kB) | Request a copy from the Strathclyde author

    Abstract

    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 fami- lies 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.