%0 Journal Article
%T THE MATCHING EQUIVALENT CLASSES OF GRAPHS WITH THE MAXIMUM MATCHING ROOT LESS THAN 2<br>匹配最大根小于2的图的匹配等价类
%A Hai Cheng MA
%A <br>马海成
%J 系统科学与数学
%D 2003
%I 
%X The matching equivalent classes of graphs with the maximum matching root less than 2 and their complement graphs are characterized.
%K Matching polynomial
%K matching equivalent
%K equivalent bridge
%K foundamen- tally equivalent<br>匹配多项式
%K 匹配等价
%K 等价桥
%K 基本等价
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=AC0389F87BE2FBBE&yid=D43C4A19B2EE3C0A&vid=EA389574707BDED3&iid=38B194292C032A66&sid=5FF9F4F7CB1800C7&eid=556C1A86E372B606&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=16&reference_num=8