2012/02/08 by Fatih Yılmaz, Yılmaz, Fatih, Şerife Burcu Bozkurt +3
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Number Theory (math.NT) #math.NT
paper · pdf · doi:10.48550/arxiv.1202.1817
arxiv created 2012/02/08 · openalex publication_date 2012/02/08 · arxiv updated 2012/02/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 Ar (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.