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