On the edge cover polynomial of a graph
From MaRDI portal
Publication:691586
DOI10.1016/j.ejc.2012.05.005zbMath1254.05077OpenAlexW1968052199MaRDI QIDQ691586
Mohammad Reza Oboudi, Saieed Akbari
Publication date: 3 December 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.05.005
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The average domination polynomial of graphs is unimodal, CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS, On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs, INDUCED CYCLE POLYNOMIAL OF A GRAPH, On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs, POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS, ON STAR POLYNOMIAL OF A VERTEX WEIGHTED CYCLE GRAPH AND ALSO OF A DIFFERENCE GRAPH, Some results on the independence polynomial of unicyclic graphs, On the roots of edge cover polynomials of graphs, Unnamed Item, Graphs whose certain polynomials have few distinct roots, The zero forcing polynomial of a graph, Some applications of Wagner's weighted subgraph counting polynomial, Unnamed Item, On a poset of trees revisited, Chromatic symmetric function of graphs from Borcherds algebras, On the location of roots of graph polynomials, On the unimodality of average edge cover polynomials, ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
