Characteristic polynomials of production matrices for geometric graphs
Rights accessOpen Access
An n×n production matrix for a class of geometric graphs has the property that the numbers of these geometric graphs on up to n vertices can be read off from the powers of the matrix. Recently, we obtained such production matrices for non-crossing geometric graphs on point sets in convex position [Huemer, C., A. Pilz, C. Seara, and R.I. Silveira, Production matrices for geometric graphs, Electronic Notes in Discrete Mathematics 54 (2016) 301–306]. In this note, we determine the characteristic polynomials of these matrices. Then, the Cayley-Hamilton theorem implies relations among the numbers of geometric graphs with different numbers of vertices. Further, relations between characteristic polynomials of production matrices for geometric graphs and Fibonacci numbers are revealed.
CitationHuemer, C., Pilz, A., Seara, C., Silveira, R.I. Characteristic polynomials of production matrices for geometric graphs. "Electronic notes in discrete mathematics", 1 Agost 2017, vol. 61, p. 1-7.