4 research outputs found
Hamltonian Connectedness and Toeplitz Graphs
A square matrix of order n is called Toeplitz matrix if it has constant elements along all diagonals parallel to the main diagonal and a graph is called Toeplitz graph if its adjacency matrix is Toeplitz. In this paper we proved that the Toeplitz graphs , for   and  are Hamiltonian  connected
Riordan graphs I : structural properties
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
On Planar Toeplitz Graphs
International audienc