کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
468896 698265 2011 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the number of independent sets in cycle-separated tricyclic graphs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
On the number of independent sets in cycle-separated tricyclic graphs
چکیده انگلیسی

A cycle-separated tricyclic graph (CSTC graph) is a connected simple graph with nn vertices and n+2n+2 edges whose subgraph induced by its cycles consists of three disjoint cycles. In this paper we investigate the number of independent sets in CSTC graphs. We show that the tight upper bound for the number of independent sets in the nn-vertex CSTC graphs is 48×2n−9+948×2n−9+9 (for n≥9n≥9); we also characterize the extremal graph with respect to the aforementioned bound.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 61, Issue 6, March 2011, Pages 1542–1546
نویسندگان
,