On the number of paths of length 5 in a graph

Autor:	Samina Abbas Boxwala, Nazanin Movarraei
Rok vydání:	2015
Předmět:	Combinatorics Discrete mathematics Graph bandwidth Graph energy law Graph power Line graph Voltage graph Regular graph Adjacency matrix Distance-regular graph law.invention Mathematics
Zdroj:	International Journal of Applied Mathematical Research. 4:30
ISSN:	2227-4324
DOI:	10.14419/ijamr.v4i1.3874
Popis:	n 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 a 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 help of combinatorics.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2730303d1c5a209eec1729b061d8b31e https://doi.org/10.14419/ijamr.v4i1.3874 Zobrazit plný text záznamu