Riordan graphs

Project: Non-funded project

Project Details


The theory of Riordan matrices is used 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 of the project is study of structural and spectral properties of families of Riordan graphs obtained from infinite Riordan graphs.
Effective start/end date22/01/1721/01/19


Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.