一类图的邻接矩阵与斐波那契数
The adjacency matrix of one type of graph and the Fibonacci numbers
摘要：
近年来，图论引起了人们极大的兴趣，矩阵的整数幂的计算也得到了广泛的研究。本文研究了一类图与著名的Fibonacci数列之间的关系。本文考虑一类2k（k= 1，2，.）图的邻接矩阵.顶点。我们还知道，对于任何正整数r，A^{r}（A是图的邻接矩阵）的第（i，j）项就是从顶点i到顶点j的遍历次数，这些遍历恰好使用k条边。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
