Yilmaz, FatihBozkurt, Durmus2020-03-262020-03-262011978-988-18210-6-52078-0958https://hdl.handle.net/20.500.12395/26687World Congress on Engineering (WCE 2011) -- JUL 06-08, 2011 -- Imperial Coll, London, UNITED KINGDOMRecently there is huge interest on graph theory and intensive study on computing integer powers of matrices. As it is well-known, the (i,j)th entry of A(m) (arbitrary positive integer power of A) is just the number of the different paths from vertex i to vertex j. In the present paper, we consider adjacency matrix of one type of graph, which is a block-diagonal matrix, and we investigate relations between the matrix and well-known Pell sequence.eninfo:eu-repo/semantics/closedAccessPell numbermatrix poweradjacency matrixOn Adjacency Matrix of One Type of Graph and Pell NumbersConference Object202204N/AWOS:000393011100040N/A