The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Yükleniyor...
Dosyalar
Tarih
2012
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
HINDAWI PUBLISHING CORPORATION
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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 A(m) (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.
Açıklama
Anahtar Kelimeler
Kaynak
JOURNAL OF APPLIED MATHEMATICS
WoS Q Değeri
Q2
Scopus Q Değeri
Q3
