New production matrices for geometric graphs

DOI10.1016/j.laa.2021.10.013zbMath1479.05153arXiv2003.00524OpenAlexW3206793494MaRDI QIDQ2666914

Rodrigo I. Silveira, Guillermo Esteban, Clemens Huemer

Publication date: 23 November 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.00524

zbMATH Keywords

generating functionscharacteristic polynomialsgeometric graphsRiordan arraysproduction matrices

Mathematics Subject Classification ID

Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Related Items (1)

Enumeration of bipartite non-crossing geometric graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Production matrices for geometric graphs
• Chords, trees and permutations
• The Riordan group
• The number of Baxter permutations
• Geometric tree graphs of points in convex position
• Analytic combinatorics of non-crossing configurations
• Bijections for ternary trees and non-crossing trees
• Characteristic polynomials of production matrices for geometric graphs
• Production matrices
• Generating trees and forbidden subsequences
• Graph of triangulations of a convex polygon and tree of triangulations
• Generating trees and proper Riordan arrays
• A new lower bound on the maximum number of plane graphs using production matrices
• Extremal statistics on non-crossing configurations
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• 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: New production matrices for geometric graphs