The vertex-cover polynomial of a graph
From MaRDI portal
Publication:1613435
DOI10.1016/S0012-365X(01)00272-2zbMATH Open1007.05079OpenAlexW2098003532MaRDI QIDQ1613435FDOQ1613435
Authors: F. M. Dong, M. D. Hendy, K. L. Teo, C. H. C. Little 
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00272-2
Recommendations
- On the coefficients of the vertex cover polynomials of cycles
- On the vertex covering sets and vertex cover polynomials of square of ladder graph
- On the cover polynomial of a digraph
- scientific article; zbMATH DE number 822142
- On the characteristic polynomials of covering number of vertices and edges of graphs
Cited In (17)
- INDUCED CYCLE POLYNOMIAL OF A GRAPH
- A Dichotomy Theorem for Polynomial Evaluation
- Properties of vertex cover obstructions
- The zero forcing polynomial of a graph
- An extension of the bivariate chromatic polynomial
- A Most General Edge Elimination Polynomial
- On the non-commuting graph of the group \(U_{6n}\)
- On the coefficients of the vertex cover polynomials of cycles
- Fractional vertex cover reliability of graphs
- An algorithm for calculating the independence and vertex-cover polynomials of a graph
- A survey on recurrence relations for the independence polynomial of hypergraphs
- The universal edge elimination polynomial and the dichromatic polynomial
- Linear Recurrence Relations for Graph Polynomials
- The drop polynomial of a weighted digraph
- On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
- On the location of roots of graph polynomials
- CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS
This page was built for publication: The vertex-cover polynomial of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613435)
