کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1141780 | 957090 | 2006 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Hypergraphs and the Clar problem in hexagonal systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We show that for a hypergraph HH that is separable and has the Helly property, the perfect matchings of HH are the strongly stable sets of the line graph of HH. Also, we show that the hypergraph generated by a hexagonal system is separable and has the Helly property. Finally, we note that the Clar problem of a hexagonal system is a minimum cardinality perfect matching problem of the hypergraph generated by the hexagonal system. Hence, the Clar problem of a hexagonal system is a minimum cardinality strongly stable set problem in the line graph of the hypergraph generated by the hexagonal system.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 3, Issue 4, 1 December 2006, Pages 392–397
Journal: Discrete Optimization - Volume 3, Issue 4, 1 December 2006, Pages 392–397
نویسندگان
Khaled Salem, Hernán Abeledo,