Paper Title :Forests with the K-Th Largest Number of Maximum Independent Sets
Author :Jenq-Jong Lin, Min-Jen Jou
Article Citation :Jenq-Jong Lin ,Min-Jen Jou ,
(2019 ) " Forests with the K-Th Largest Number of Maximum Independent Sets " ,
International Journal of Management and Applied Science (IJMAS) ,
pp. 34-36,
Volume-5,Issue-9
Abstract : Consider a graph G=(V,E). A subset I of the vertex set V(G) is independent if there is no edge of G between any
two vertices of I. A maximum independent set is an independent set of maximum size. In this paper we complete the
determination of the k-th ( 4 k n / 2 ) largest numbers of maximum independent sets among all forests of order n 8 .
Extremal graphs achieving these values are also given.
Type : Research paper
Published : Volume-5,Issue-9
Copyright: © Institute of Research and Journals
| |
 |
| |
 |
PDF |
| |
Viewed - 57 |
| |
Published on 2019-11-16 |
|
