Self-Avoiding Paths and the Adjacency Matrix of a Graph
From MaRDI portal
Publication:5524331
DOI10.1137/0114051zbMATH Open0146.45901OpenAlexW2042086777MaRDI QIDQ5524331FDOQ5524331
Author name not available (Why is that?)
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
Cited In (7)
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- Sign determinacy of M-matrix minors
- The graph bottleneck identity
- Geometry of the faithfulness assumption in causal inference
- Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs
- Relations between connected and self-avoiding hikes in labelled complete digraphs
- The walk distances in graphs
This page was built for publication: Self-Avoiding Paths and the Adjacency Matrix of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5524331)
