Self-Avoiding Paths and the Adjacency Matrix of a Graph
From MaRDI portal
Publication:5524331
DOI10.1137/0114051zbMath0146.45901OpenAlexW2042086777MaRDI QIDQ5524331
No author found.
Publication date: 1966
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0114051
Related Items (7)
Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs ⋮ Sign determinacy of M-matrix minors ⋮ Relations between connected and self-avoiding hikes in labelled complete digraphs ⋮ Geometry of the faithfulness assumption in causal inference ⋮ The walk distances in graphs ⋮ Routing by ranking: a link analysis method for the constrained dial-a-ride problem ⋮ The graph bottleneck identity
This page was built for publication: Self-Avoiding Paths and the Adjacency Matrix of a Graph
