کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6872659 | 684166 | 2012 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Independence polynomials of some compound graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Independence polynomials of some compound graphs Independence polynomials of some compound graphs](/preview/png/6872659.png)
چکیده انگلیسی
An independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covered if all its maximal independent sets have the same size, denoted by α(G). Let fs(G) for 0â¤sâ¤Î±(G) denote the number of independent sets of s vertices in G. The independence polynomial I(G;x)=âi=0α(G)fs(G)xs defined first by Gutman and Harary has been the focus of considerable research recently. Motivated by a result of Gutman for some compound graphs, we extend the result for more general compound graphs. In particular, we use our main results to determine the coefficients fs(G) for some well-covered graphs and present the exact independence polynomials of several well-covered graphs. Using the independence polynomials we derive some interesting combinatorial identities and give exact values of the Merrifield-Simmons index for some special classes of graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 160, Issues 4â5, March 2012, Pages 657-663
Journal: Discrete Applied Mathematics - Volume 160, Issues 4â5, March 2012, Pages 657-663
نویسندگان
Lanzhen Song, William Staton, Bing Wei,