On the matching polynomial of theta graphs

被引：0
作者：
Zhang, Hailiang [1 ,2 ]
Shu, Jinlong [1 ]
机构：
[1] E China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
[2] Taizhou Univ, Dept Math, Linhai 317000, Zhejiang, Peoples R China
来源：
ARS COMBINATORIA | 2012年 / 105卷
基金：
浙江省自然科学基金;
关键词：
Matching Polynomial; Matching equivalent; Matching unique; The largest matching root; Theta graph;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A theta graph is denoted by theta(a, b, c), a <= b <= c. It is obtained by subdividing the edges of the multigraph consisting of 3 parallel edges a times, b times and c times each. In this paper, we show that the theta graph is matching unique when a >= 2 or a = 0, and all theta graphs are matching equivalent when only one of the edges is subdivided one time. We also completely characterize the relation between the largest matching root lambda and the length of path a, b, c of a theta graph, and determine the extremal theta graphs.
引用
收藏
页码：477 / 490
页数：14
相关论文
共 13 条
12