On a general class of graph polynomials

From MaRDI portal
Publication:1226488

DOI10.1016/0095-8956(79)90049-2zbMath0328.05006OpenAlexW1980950380MaRDI QIDQ1226488

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




Related Items (26)

The matching polynomial of a regular graphKnots and Graphs: Two Centuries of InteractionA bibliography on chromatic polynomialsAlgorithmic uses of the Feferman-Vaught theoremMore connections between the matching polynomial and the chromatic polynomialThe Clar covering polynomial of hexagonal systems. IFarrell polynomials on graphs of bounded tree widthThe ratio of the numbers of odd and even cycles in outerplanar graphsGraphs, networks, and linear unbiased estimatesTree counting polynomials for labelled graphs. I: PropertiesGraphs whose certain polynomials have few distinct rootsThe circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrencesHigher-order matching polynomials and \(d\)-orthogonalityAn introduction to matching polynomialsCoulson integral formula for the vertex energy of a graphOn F-polynomials of thistlesOn a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphsDevelopments in the theory of graph spectraUnnamed ItemForest decompositions of laddersOn a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomialsReconstructing subgraph-counting graph polynomials of increasing families of graphsThe cycle (circuit) polynomial of a graph with double and triple weights of edges and cyclesGeneralized chromatic polynomialsThe behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal



Cites Work


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