Random walks on the triangular prism and other vertex-transitive graphs
From MaRDI portal
(Redirected from Publication:1075340)
Recommendations
Cites work
- A new 5‐arc‐transitive cubic graph
- Finite Continuous Time Markov Chains
- Homological Coverings of Graphs
- scientific article; zbMATH DE number 3645098 (Why is no real title available?)
- scientific article; zbMATH DE number 3332250 (Why is no real title available?)
- Random walks on graphs
- RANDOM WALKS ON REGULAR POLYHEDRA AND OTHER DISTANCE–REGULAR GRAPHS
Cited in
(12)- Random walks on edge transitive graphs
- The expected hitting times for graphs with cutpoints.
- Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost
- On the number of walks in a triangular domain
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications
- Hitting times for random walks on vertex-transitive graphs
- Hitting times for random walks on subdivision and triangulation graphs
- Expected hitting times for random walks on quadrilateral graphs and their applications
- Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
- On special properties of some quasi-metrics
- Random walks associated with symmetric \(M\)-matrices
This page was built for publication: Random walks on the triangular prism and other vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075340)