Advances and Applications in Discrete Mathematics
Volume 5, Issue 2, Pages 85 - 96
(April 2010)
|
|
UNICYCLIC GRAPHS WITH THE EXTREMAL NUMBER OF INDEPENDENT SETS CONTAINING PENDANT VERTICES
Andrzej Włoch and Iwona Włoch
|
Abstract: A subset S of
vertices of a graph G is independent
if no two vertices in S are adjacent.
In this paper, we study independent sets in unicyclic graphs containing pendant
vertices. In particular, the smallest number and the largest number of these
sets among n-vertex unicyclic graphs
are determined characterizing corresponding graphs. |
Keywords and phrases: independent set, unicyclic graph, Fibonacci number. |
|
Number of Downloads: 225 | Number of Views: 570 |
|