Fibonacci numbers and Lucas numbers in graphs

被引：14
|
作者：
Startek, Mariusz [1 ]
Wloch, Andrzej [1 ]
Wloch, Iwona [1 ]
机构：
[1] Rzeszow Tech Univ, Fac Math & Appl Phys, PL-35959 Rzeszow, Poland
来源：
DISCRETE APPLIED MATHEMATICS | 2009年 / 157卷 / 04期
关键词：
Independent sets; Fibonacci numbers; Counting; INDEPENDENT SETS; TREES;
D O I：
10.1016/j.dam.2008.08.028
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A subset S C V(G) is independent if no two vertices of S are adjacent in G. In this paper we study the number of independent sets in graphs with two elementary cycles. In particular we determine the smallest number and the largest number of these sets among n-vertex graphs with two elementary cycles. The extremal values of the number of independent sets are described using Fibonacci numbers and Lucas numbers. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：864 / 868
页数：5
相关论文
共 50 条
12345