Characteristic polynomials of production matrices for geometric graphs

DOI10.1016/j.endm.2017.07.017zbMath1379.05030DBLPjournals/endm/HuemerPSS17OpenAlexW2745200682WikidataQ61732463 ScholiaQ61732463MaRDI QIDQ1689984

Clemens Huemer, Rodrigo I. Silveira, Alexander Pilz, Carlos Seara

Publication date: 18 January 2018

Full work available at URL: http://hdl.handle.net/2117/111649

zbMATH Keywords

geometric graphRiordan arrayproduction matrixFibonacci number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (3)

New production matrices for geometric graphs ⋮ New results on production matrices for geometric graphs ⋮ A new lower bound on the maximum number of plane graphs using production matrices

Cites Work

• Production matrices for geometric graphs
• Geometric tree graphs of points in convex position
• Analytic combinatorics of non-crossing configurations
• Production matrices
• Graph of triangulations of a convex polygon and tree of triangulations
• Generating trees and proper Riordan arrays
• ECO:a methodology for the enumeration of combinatorial objects
• On the Eigenvalues and Eigenvectors of a Class of Hessenberg Matrices

This page was built for publication: Characteristic polynomials of production matrices for geometric graphs