Pages that link to "Item:Q5452182"
From MaRDI portal
The following pages link to Linear Recurrence Relations for Graph Polynomials (Q5452182):
Displaying 11 items.
- Strongly polynomial sequences as interpretations (Q334158) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Recurrence relations for graph polynomials on bi-iterative families of graphs (Q740263) (← links)
- Recursively constructible families of graphs (Q1433010) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Solutions of linear recurrence equations (Q1732242) (← links)
- On graph invariants given by linear recurrence relations (Q1812827) (← links)
- On sequences of polynomials arising from graph invariants (Q2408975) (← links)
- Graph polynomials: from recursive definitions to subset expansion formulas (Q2882559) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- Effective optimization with weighted automata on decomposable trees (Q5413875) (← links)