From Integer Sequences to Block Designs via Counting Walks in Graphs
From MaRDI portal
Publication:6239382
arXiv1302.1176MaRDI QIDQ6239382FDOQ6239382
Authors: Ernesto Estrada, José A. de la Peña 
Publication date: 5 February 2013
Abstract: We define numbers of the type Oj(N) and Ej(N) and the corresponding integer sequences. We prove that these integer sequences, e.g., SO(N) and SE(N) correspond to the number of odd and even walks in complete graphs. We then prove that there is a unique family of graphs which have exactly the same sequence of odd walks between connected nodes and of even walks between pairs of nodes at distance two, respectively. These graphs are obtained as the Kronecker product. We show that they are the incidence graphs of block designs, are distance-regular and Ramanujan graphs.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of block designs (05B05) Graph operations (line graphs, products, etc.) (05C76) Random walks on graphs (05C81) Sequences and sets (11B99)
This page was built for publication: From Integer Sequences to Block Designs via Counting Walks in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239382)
