Relations between connected and self-avoiding hikes in labelled complete digraphs

DOI10.1007/s00373-016-1696-9zbMath1349.05152OpenAlexW2315744018MaRDI QIDQ343737

Thibault Espinasse, Paul Rochet

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1696-9

zbMATH Keywords

posetdirected graphwalkincidence algebraweighted adjacency matrix

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Signed and weighted graphs (05C22)

Related Items (1)

A Hopf algebra for counting cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypothesis testing for Markovian models with random time observations
• Estimating the transition matrix of a Markov chain observed at random times
• Random walks and diffusions on graphs and databases. An introduction.
• Time changes of Markov chains
• Combinatorial problems of commutation and rearrangements
• Matrices, Digraphs, and Determinants
• The Determinant of the Adjacency Matrix of a Graph
• Estimation of Time-Varying Markov Processes with Aggregate Data
• Trace Formulae of Characteristic Polynomial and Cayley–Hamilton's Theorem, and Applications to Chiral Perturbation Theory and General Relativity
• Random walks on graphs: ideas, techniques and results
• Self-Avoiding Paths and the Adjacency Matrix of a Graph

This page was built for publication: Relations between connected and self-avoiding hikes in labelled complete digraphs