Returning Paths on Cubic Graphs

random-walk graph-theory

Suppose we have a 3-edge-colorable cubic graph with $N$ vertices. How many paths of length $N$ exist that return to its origin?

Or putting it differently: What is "Pólya's Random Walk Constant" on such graphs?


Solution 1:

I think what I was looking for is simply the diagonal entries of the $N$-th power of the adjacence matrix for the given graph. Maybe I should have noted that I'm dealing with finite graphs and I'm not expert enough to see if Pólya's Random Walk Constant makes sense here.

Related

How to find $\lim_{x \to \infty} [x]/x$?
elementary row operation change the eigenvalue of a matrix
Sufficient and necessary conditions to get an infinite fiber $g^{-1}(w)$
If $\mathbb R^3\setminus V$ connected where $V$ is the subspace generated by $\{(1,1,1),(0,1,1)\} $
Does the Frobenius coin problem require the denominations to be pairwise relatively prime?
$f$ function with $\nabla f=\bar{0}$
$\nabla \cdot \big(\frac{\hat{r}}{r^{2}}\big)$ and Dirac Delta Function
fundamental groups of open subsets of the plane
Restrictions on the use of universal generalization
Nonsingular projective curve model corresponding to $y^2 = x^4+1$
Real analysis of powers
Splitting field of $x^n-a$ contains all $n$ roots of unity