A matrix for counting paths in acyclic digraphs

DOI10.1006/jcta.1996.0046zbMath0860.05054OpenAlexW2125622766MaRDI QIDQ1914006

Richard P. Stanley

Publication date: 9 July 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d442aa430bdbe252e8b816e3e08501493fa372d7

zbMATH Keywords

acyclic digraphmatrix for counting pathsnumber paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Combinatorial proofs of some determinantal identities ⋮ Total nonnegativity and (3+1)-free posets ⋮ Evolution on distributive lattices ⋮ A simple elementary proof of ``the unimodularity theorem of Oliver Knill ⋮ A characterization of \((3+1)\)-free posets ⋮ Riordan-Krylov matrices over an algebra ⋮ Flows with unit path capacities and related packing and covering problems ⋮ Acyclic Digraphs

This page was built for publication: A matrix for counting paths in acyclic digraphs