Multi-Eulerian tours of directed graphs

zbMath1335.05041arXiv1509.06237MaRDI QIDQ281626

Matthew Farrell, Lionel Levine

Publication date: 11 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.06237

zbMATH Keywords

LaplacianEulerian digraphBEST theoremcoEulerian digraphEulerian pathMarkov chain tree theoremmatrix-tree theoremoriented spanning treeperiod vectorPham indexrotor walk

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Spectral moments of hypertrees and their applications ⋮ Perfect boundaries in rotor-router aggregation on cylinders ⋮ Estrada index and subgraph centrality of hypergraphs via tensors ⋮ Random integral matrices: universality of surjectivity and the cokernel

Cites Work

• Unnamed Item
• Unnamed Item
• Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
• Chip-firing games on directed graphs
• CoEulerian graphs
• Chip-Firing and Riemann-Roch Theory for Directed Graphs
• Rotor Walks and Markov Chains
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Chip-Firing and Rotor-Routing on Directed Graphs
• On Unicursal Paths in a Network of Degree 4

This page was built for publication: Multi-Eulerian tours of directed graphs