On the Number of cycles in a Graph

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.

Saved in:
Bibliographic Details
Published in:arXiv.org 2015-03
Main Author: Movarraei, Nazanin
Format: Article
Language:English
Subjects:
Combinatorial analysis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422