DOIONLINE

DOIONLINE NO - IJMAS-IRAJ-DOIONLINE-16069

Publish In
International Journal of Management and Applied Science (IJMAS)-IJMAS
Journal Home
Volume Issue
Issue
Volume-5,Issue-9  ( Sep, 2019 )
Paper Title
Forests with the K-Th Largest Number of Maximum Independent Sets
Author Name
Jenq-Jong Lin, Min-Jen Jou
Affilition
Department of Finance, Ling Tung University, Taichung 40852, Taiwan 2Department of Information Technology, Ling Tung University, Taichung 40852, Taiwan
Pages
34-36
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.
  View Paper