The Number of Maximal Independent Sets in the Pm-extended of Graphs

摘要：

　　A maximal independent set is an independent set that is not a proper subset of any other independent set.Given a graph G of order n,we define the m P-extended of G,denoted G(m),as the graph consisting of G together with n copies of m P,a leaf of each path attached to exactly one vertex of G.In this paper,we determine the number of maximal independent sets of the m P-extended of a star and a path.

关键词： Star Path Maximal independent set m P-extended

作者: Jenq-Jong Lin Min-Jen Jou

作者单位: Ling Tung University,Taichung 40852,Taiwan

会议类型: 国际会议

会议名称: INTERNATIONAL CONFERENCE ON COMPUTATIONAL MODELING, SIMULATION AND OPTMIZATION (CMSO 2019)(2019年计算建模、仿真与优化国际会议)

会议地点: 北京

会议语种:英文

页码: 236-240

在线出版日期: 2019-11-24（万方平台首次上网日期，不代表论文的发表时间）