  In this paper, we obtain explicit formulae for the number of 7-cycles and the
total number of paths of lengths 6 and 7 those contain a specific vertex
$v_{i}$ in a simple graph G, in terms of the adjacency matrix and with the help
of combinatorics.
