Production matrices for geometric graphs
From MaRDI portal
Publication:510608
DOI10.1016/j.endm.2016.09.052zbMath1356.05028OpenAlexW2536539686WikidataQ61732466 ScholiaQ61732466MaRDI QIDQ510608
Carlos Seara, Rodrigo I. Silveira, Alexander Pilz, Clemens Huemer
Publication date: 13 February 2017
Full work available at URL: http://hdl.handle.net/2117/103649
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Planar graphs; geometric and topological aspects of graph theory (05C10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (4)
New production matrices for geometric graphs ⋮ Characteristic polynomials of 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
- 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
- Extremal statistics on non-crossing configurations
- ECO:a methodology for the enumeration of combinatorial objects
- A Class of Hessenberg Matrices with Known Eigenvalues and Inverses
- On the Eigenvalues and Eigenvectors of a Class of Hessenberg Matrices
This page was built for publication: Production matrices for geometric graphs