Open AccessOn the number of paths of length 6 in a graph
Author(s) -
Nazanin Movarraei,
Samina Boxwala
Publication year - 2015
Publication title -
international journal of applied mathematical research
Language(s) - English
Resource type - Journals
ISSN - 2227-4324
DOI - 10.14419/ijamr.v4i2.4314
Subject(s) - mathematics , adjacency matrix , combinatorics , graph , adjacency list , simple graph , simple (philosophy) , discrete mathematics , philosophy , epistemology
In this paper, we obtain an explicit formula for the total number of paths of length 6 in a simple graph G, in terms of the adjacency matrix and with the help of combinatorics.