Walks on directed graphs and matrix polynomials
The author considers matrix polynomial generalizations of the following classical families of binomial type: the decreasing factorials, the increasing factorials, the exponential polynomials, and the Laguerre polynomials. The approach adopted here is purely combinatorial, and the four families of matrix polynomials are interpreted in terms of walks on digraphs, and all the proofs of algebraic identities presented are bijective. The recursive formulae given here for the exponential and Laguerre polynomials are natural generalizations of the classical Rodrigues formula.
- Multiple Laguerre polynomials: combinatorial model and Stieltjes moment representation
- Matrix valued Laguerre polynomials
- scientific article; zbMATH DE number 7099278
- scientific article; zbMATH DE number 1186090
- Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph
This page was built for publication: Walks on directed graphs and matrix polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584671)