2017/12/15 by Barrett, Wayne, Evans, Emily J., Francis, Amanda E.
#05C05 #05C12 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1712.05859
In this note we consider the bent linear 2-tree and provide an explicit formula for the resistance distance rGn(1,n) between the first and last vertices of the graph. We call the graph Gn with vertex set V(Gn) = \ 1, 2, …, n\ and \i,j\ ∈ E(Gn) if and only if 0