Graph polynomials
type: Item
instance of: scholarly article
title: Graph polynomials
zbMATH Open document ID: 1295.05124
DOI: 10.5402/2011/193560
author: Mehdi Alaeiyan
author: Saeid Mohammadian
published in: ISRN Algebra
publication date: 2011-10-28T00:00:00Z
review text: Summary: 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, 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.
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5964861
zbMATH Keywords: binary programming
zbMATH Keywords: linear programming
Wikidata QID: Q58689057
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.5402/2011/193560
OpenAlex ID: W4231164562
cites work: Q4869540
cites work: Constant-time distributed dominating set approximation
description: scientific article; zbMATH DE number 5964861