Graph Polynomials | Zendy

Mehdi Alaeiyan | Zendy; Saeid Mohammadian | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Graph Polynomials

Author(s) -

Mehdi Alaeiyan,

Saeid Mohammadian

Publication year - 2011

Publication title -

isrn algebra

Language(s) - English

Resource type - Journals

eISSN - 2090-6293

pISSN - 2090-6285

DOI - 10.5402/2011/193560

Subject(s) - edge cover , mathematics , combinatorics , vertex cover , cover (algebra) , binary number , discrete mathematics , graph , mechanical engineering , arithmetic , engineering

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 variables.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research