Nazanin Movarraei
Published 2014-05-24Version 1
In this paper, we obtain an explicit formula for the total number of paths of length 5 in a simple graph G. We also determine some formulae for the number of paths of length 5 each of which starts from an specific vertex $v_{i}$ and for the number of $v_{i}-v_{j}$ paths of length 5 in a simple graph G, in terms of the adjacency matrix and with the helps of combinatorics.
Comments: 22 pages, 62 figures
The number of ideals of $\mathbb{Z}[x]$ containing $x(x-α)(x-β)$ with given index
Nonpositive Eigenvalues of the Adjacency Matrix and Lower Bounds for Laplacian Eigenvalues
The kernel of the adjacency matrix of a rectangular mesh
![QR code for arXiv:1405.6272 [math.CO]](http://oss.arxitics.com/images/favicon.svg)