On F-polynomials of thistles
From MaRDI portal
A general formula is derived for the F-polynomial of thistles - a family of graphs obtained by attaching twigs (hinged edges) to all the nodes of a basic member. The formula involves a function which is identified explicitly for certain types of F-polynomials. The function is then used to partially characterize a special family of thistles.
Recommendations
- scientific article; zbMATH DE number 22644
- scientific article; zbMATH DE number 1744076
- Thom polynomials
- A polynomial approach to Faltings's theorem
- Thom polynomials and around
- scientific article; zbMATH DE number 7283883
- On the properties of fibotomic polynomials
- scientific article; zbMATH DE number 5798475
- Combinatorics of F-Polynomials
- Thom polynomials with integer coefficients
Cites work
- An introduction to matching polynomials
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3664978 (Why is no real title available?)
- On a class of polynomials associated with the cliques in a graph and its applications
- On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
- On a Class of Polynomials Associated with the Stars of a Graph and its Application to Node-Disjoint Decompositions of Complete Graphs and Complete Bipartite Graphs into Stars
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
- On a general class of graph polynomials
Cited in
(3)
This page was built for publication: On F-polynomials of thistles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579282)
