On the roots of edge cover polynomials of graphs

DOI10.1016/j.ejc.2011.06.009zbMath1337.05057OpenAlexW1992716804MaRDI QIDQ648996

Péter Csikvári, Mohammad Reza Oboudi

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.06.009

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On the roots of domination polynomial of graphs ⋮ The average domination polynomial of graphs is unimodal ⋮ On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Edge covering problem under hybrid uncertain environments ⋮ Maximum modulus of independence roots of graphs and trees ⋮ On the roots of the subtree polynomial ⋮ Some results on the independence polynomial of unicyclic graphs ⋮ Unnamed Item ⋮ Graphs whose certain polynomials have few distinct roots ⋮ Some applications of Wagner's weighted subgraph counting polynomial ⋮ A logician's view of graph polynomials ⋮ Chromatic symmetric function of graphs from Borcherds algebras ⋮ On the location of roots of graph polynomials ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic ⋮ On a Poset of Trees II ⋮ On the unimodality of average edge cover polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a poset of trees
• Matching polynomials and duality
• On the location of roots of independence polynomials
• On the edge cover polynomial of a graph
• An extension of the bivariate chromatic polynomial
• Problems in algebraic combinatorics
• Chromatic roots and Hamiltonian paths
• Theory of monomer-dimer systems
• On the eigenvalues of trees
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• On a Poset of Trees II
• The Zero-Free Intervals for Chromatic Polynomials of Graphs

This page was built for publication: On the roots of edge cover polynomials of graphs