Graph Polynomials
Joint Authors
Mohammadian, Saeid
Alaeiyan, Mehdi
Source
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-08-25
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract 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.
American Psychological Association (APA)
Alaeiyan, Mehdi& Mohammadian, Saeid. 2011. Graph Polynomials. ISRN Algebra،Vol. 2011, no. 2011, pp.1-10.
https://search.emarefa.net/detail/BIM-453425
Modern Language Association (MLA)
Alaeiyan, Mehdi& Mohammadian, Saeid. Graph Polynomials. ISRN Algebra No. 2011 (2011), pp.1-10.
https://search.emarefa.net/detail/BIM-453425
American Medical Association (AMA)
Alaeiyan, Mehdi& Mohammadian, Saeid. Graph Polynomials. ISRN Algebra. 2011. Vol. 2011, no. 2011, pp.1-10.
https://search.emarefa.net/detail/BIM-453425
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-453425
