摘要
一个奇圈上加两条奇长的悬挂路组成的图形,称为Eta图.从Eta图的构造出发,研究了最大匹配数为|V(G)|+4的Eta图,得到了10种满足条件的结构.
Eta graph is a graph get by adding two odd pending paths on an odd cycle.Starting from the construction of Eta graph,we get ten types of structure of Eta graph with|V(G)| + 4 maximum matchings.
引文
[1]杨秀,赵飚.八边形链的Kekule结构和Caterpillar树的Hosoya指标[J].新疆大学学报(自然科学版),2013, 30(3):274-277, 373.
[2] Cyvin S J, Gutman I. Kekule structures and their symmetry properties[J]. Computers Math Applic,1986, 12B(3/4):859-876.
[3] Lovasz L, Plummer M D. Matching Theory[M]. B V North Holland:Elsevier Science Publishers,1985.
[4] Bondy J A, Murty U S R. Graph Theory with Applications[M]. London:Macmillan Press Ltd,1976.
[5] Liu Y. Factor-critical graphs with the given number of maximum matchings[J]. Graphs and Comb,2008, 24:1-7.
[6] Liu Y,Yang C X. Factor-critical graph g with|V(G)|+2 maximum matchings[J]. Acta Mathematica Scientia, 2009, 29A(2):486-493.
[7]陈平.具有|V(G)|+3个最大匹配的因子临界图的结构[D].广州:华南师范大学,2009.