Extremal Multi-bridge Graphs With Respect To Merrifield-Simmons Index

被引：0
|
作者：
Chen, Shubo [2 ]
Liu, Weijun [1 ]
机构：
[1] Nantong Univ, Sch Sci, Nantong 226007, Jiangsu, Peoples R China
[2] Hunan City Univ, Dept Math & Comp Sci, Yiyang 413000, Hunan, Peoples R China
来源：
ARS COMBINATORIA | 2011年 / 102卷
关键词：
HEXAGONAL CHAINS; UNICYCLIC GRAPHS; HOSOYA INDEXES; FIBONACCI NUMBERS; INDEPENDENT SETS; ENUMERATION; SUBSETS; TREES;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The Merrifield-Simmons index of a graph G, denoted by i(G), is defined to be the total number of its independent sets, including the empty set. Let theta(a(1), a(2), ..., a(k)) denote the graph obtained by connecting two distinct vertices with k independent paths of lengths a(1), a(2), ..., a(k) respectively, we named it as multi-bridge graphs for convenience. Tight upper and lower bounds for the Merrifield-Simmons index of theta(a(1), a(2), ..., a(k)) are established in this paper.
引用
收藏
页码：161 / 172
页数：12
相关论文
共 50 条
12345