arXiv subjects
Publications and source records attributed to Fatih Yılmaz.
In the present paper, we define two directed pseudo graphs. Then, we investigate the adjacency matrices of the defined graphs and show that the permanents of the adjacency matrices are Jacobsthal and Jacobsthal-Lucas numbers.
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we consider the adjacency matrix of one type of graph with 2k (k=1,2,...) vertices. It is also known that for any positive integer r, the (i,j)th entry of A^{r} (A is the adjacency matrix of the graph) is just the number of walks from vertex i to vertex j, that use exactly k edges.
Let P=\circ(P_{1},P_{2},...,P_{n}) and Q=\circ(Q_{1},Q_{2},...,Q_{n}) be n\timesn circulant matrices where P_{n} and Q_{n} are nth Pell and Pell-Lucas numbers, respectively. The determinants of the matrices P and Q were expressed by the Pell and Pell-Lucas numbers. After, we prove that the matrices P and Q are the invertible for n\geq3 and then the inverses of the matrices P and Q are derived.