Graph Polynomials

الملخص EN

One of the most important and applied concepts in graph theory is to find the edge cover, vertex cover, and dominating sets with minimum cardinal also to find independence and matching sets with maximum cardinal and their polynomials.

Although there exist some algorithms for finding some of them (Kuhn and Wattenhofer, 2003; and Mihelic and Robic, 2005), but in this paper we want to study all of these concepts from viewpoint linear and binary programming and we compute the coefficients of the polynomials by solving a system of linear equations with {0,1} variables.