Trees with the second and third largest number of maximum independent sets

被引：0

作者：

Lin, Jenq-Jong ^{[1
]}

机构：

[1] Ling Tung Univ, Taichung 40852, Taiwan

来源：

ARS COMBINATORIA | 2015年 / 123卷

关键词：

GRAPHS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An independent set in a graph G is a subset I of the vertices such that no two vertices in I are adjacent. We say that I is a maximum independent set in G if no other independent set is larger than I. In this paper, we study the problem of determining the second and third largest number of maximum independent sets among all trees and forests. Extremal graphs achieving these values are also given.

引用

页码：317 / 327

页数：11

共 8 条

[1] Graphs with the second largest number of maximal independent sets [J].