کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4650877 | 1632442 | 2008 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Ideals and graphs, Gröbner bases and decision procedures in graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Ideals and graphs, Gröbner bases and decision procedures in graphs Ideals and graphs, Gröbner bases and decision procedures in graphs](/preview/png/4650877.png)
چکیده انگلیسی
The well known correspondence between even cycles of an undirected graph and polynomials in a binomial ideal associated to a graph is extended to odd cycles and polynomials in another binomial ideal. Other binomial ideals associated to an undirected graph are also introduced. The results about them with topics on monomial ideals are used in order to show decision procedures for bipartite graphs, minimal vertex covers, cliques, edge covers and matchings with algebraic tools. All such procedures are implemented in Maple 9.5.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 308, Issues 2–3, 6 February 2008, Pages 287–298
Journal: Discrete Mathematics - Volume 308, Issues 2–3, 6 February 2008, Pages 287–298
نویسندگان
Giuseppa Carra’ Ferro, Daniela Ferrarello,