The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation

Fatih Yılmaz and Durmuş Bozkurt

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph. By using the well‐known property which states the (i, j) entry of Am (A is adjacency matrix) is equal to the number of walks of length m from vertex i to vertex j, we show that elements of mth positive integer power of the adjacency matrix correspond to well‐known Jacobsthal numbers. As a consequence, we give a Cassini‐like formula for Jacobsthal numbers. We also give a matrix whose permanents are Jacobsthal numbers.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/423163

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:423163

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().