On the Number of cycles in a Graph
classification
🧮 math.CO
keywords
numbercyclesgraphadjacencycombinatoricscontainexplicitformulae
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.