The adjacency matrix of one type of directed graph and the Jacobsthal numbers and their determinantal representation

DOI10.1155/2012/423163zbMath1258.05079WikidataQ58905867 ScholiaQ58905867MaRDI QIDQ1760684

Durmuş Bozkurt, Fatih Yilmaz

Publication date: 15 November 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/423163

zbMATH Keywords

adjacency matrix; directed graph; number of walks; Jacobsthal number

Mathematics Subject Classification ID

15A15: Determinants, permanents, traces, other special matrix functions

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

Unnamed Item, Unnamed Item, ON DETERMINANTS AND PERMANENTS OF SOME TOEPLITZ-HESSENBERG MATRICES WHOSE ENTRIES ARE JACOBSTHAL NUMBERS, Relationships between the permanents of a certain type of \(k\)-tridiagonal symmetric Toeplitz matrix and the Chebyshev polynomials

Cites Work

• Hessenberg matrices and the Pell and Perrin numbers
• On the Fibonacci and Lucas \(p\)-numbers, their sums, families of bipartite graphs and permanents of certain matrices
• Incomplete generalized Jacobsthal and Jacobsthal-Lucas numbers
• Fibonacci numbers and Lucas numbers in graphs
• On computing of arbitrary positive integer powers for one type of symmetric pentadiagonal matrices of even order
• On computing of arbitrary positive integer powers for one type of symmetric tridiagonal matrices of even order. I
• Permanents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item