一类Caterpillars图的匹配刻画On matching characterization of a Caterpillars
申世昌;
摘要(Abstract)：
利用匹配多项式的性质以及匹配根的信息研究了图的匹配刻画问题,给出了一类Caterpillars图F(2,m,3)及补图匹配刻画的充分必要条件是m=2,5,8.
关键词(KeyWords)： Caterpillars图;匹配多项式;匹配刻画
基金项目(Foundation): 国家自然科学基金(10861009)
作者(Authors): 申世昌;
参考文献(References)：
- [1]Godsil C D.Algebraic Combinatorics[M].New York:Chapman and Hall,1993.
- [2]Wang Y,Chakrabarti D,Wang C,et al.Epidemic Spreading in Real Network:An Eigenvalue Viewpoint[C].Italy:Florence,2003.
- [3]Vandam E R,Kooij R E.The minimum Spectral radii of graphs with a given diameter[J].Linear Algebra Appl.,2007,423:408-419.
- [4]Slobodan K S,Enzomaria L M,Francesco B.On the index of caterpillars[J].discrete.Math.,2008,308:324330.
- [5]Brouwer A E,Neumaier A.The graph with spectral radius between2and2+√5[J].Linear Algebra Appl.,1989,114/115:273-276.
- [6]Cvetkovic D M,Doob M,Sachs H.Spertra of Graphs[M].New York:Academic Press,1980.
- [7]申世昌.T(2,3,n)及补图的匹配唯一性[J].西南师范大学学报:自然科学版,2006,31(2):23-26.
- [8]申世昌.K1∪T(1,3,n)及其补图的匹配刻画[J].西南师范大学学报:自然科学版,2009,34(3):5-9.
- [9]Beezet R A,Farrell E J.The matching polynomials of a regular graphs[J].discrete.Math.,1995,137:7-18.