On F-polynomials of thistles

DOI10.1016/0016-0032(87)90047-0zbMath0625.05047OpenAlexW1969154362MaRDI QIDQ579282

E. J. Farrell

Publication date: 1987

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(87)90047-0

zbMATH Keywords

F-polynomialthistles

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (1)

The independence polynomial of rooted products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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 general class of graph polynomials
• An introduction to matching polynomials
• On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
• On a class of polynomials associated with the cliques in a graph and its applications
• 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

This page was built for publication: On F-polynomials of thistles