On a general class of graph polynomials

DOI10.1016/0095-8956(79)90049-2MaRDI QIDQ1226488zbMATH OpenOpenAlexFDO

Authors E. J. Farrell

Publication date 1979

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(79)90049-2

zbMATH Keywords

CONNECTF-POLYNOMIALSGRAPH POLYNOMIALSSPANNING SUBGRAPHWEIGHT

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph theory (05Cxx) Other special functions (33E99)

Cites work

• scientific article; zbMATH DE number 3679828 (Why is no real title available?)
• scientific article; zbMATH DE number 3482387 (Why is no real title available?)
• scientific article; zbMATH DE number 3222645 (Why is no real title available?)
• Meditations on the product rule
• On dichromatic polynomials

Cited in

(29)

• Tree counting polynomials for labelled graphs. I: Properties
• 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
• The matching polynomial of a regular graph
• A bibliography on chromatic polynomials
• Farrell polynomials on graphs of bounded tree width
• Graphs, networks, and linear unbiased estimates
• Forest decompositions of ladders
• The Clar covering polynomial of hexagonal systems. I
• More connections between the matching polynomial and the chromatic polynomial
• The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
• Coulson integral formula for the vertex energy of a graph
• The circuit polynomial of the restricted rooted product G( ) of graphs with a bipartite core G
• Reconstructing subgraph-counting graph polynomials of increasing families of graphs
• The ratio of the numbers of odd and even cycles in outerplanar graphs
• Knots and graphs: two centuries of interaction
• Graphs whose certain polynomials have few distinct roots
• Developments in the theory of graph spectra
• On a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomials
• The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
• On some parameters related to fixing sets in graphs
• Higher-order matching polynomials and \(d\)-orthogonality
• On F-polynomials of thistles
• Algorithmic uses of the Feferman-Vaught theorem
• On star polynomials of digraphs and their applications to domination
• Meta-theorems for graph polynomials
• Labeled graph rearrangements on matched and star products
• Generalized chromatic polynomials
• The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal

This page was built for publication: On a general class of graph polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1226488)