摘要
设G是一个简单图,M（G;W）是由Farrell引进的G的匹配多项式,若对任何图H,M（G;W）=M（H;W）导出G同构于H,则称G是匹配唯一的。Farrell和Guo首先研究了圈和道路的匹配唯一性问题。本文研究具有度序列（4~1,2~（p-1））的图的匹配唯一性,得到了若干匹配唯一的图类。
Let G be a graph containing neither loops nor multiple edges, Let M(G; W) be the matching polynomial of G introduced by Farrell, then G is said to be matching unique if for any graph H other than G,M (G;W) = M (H;W) implies that G≌H, Farrell and Guo investigated the matching uniqueness of the cycles and paths for the first time, The matching uniqueness of the. graphs with degree sequence (41, 2p-1) is discussed, and some matching unique graphs have deen obtained.
出处
《华中理工大学学报》
CSCD
北大核心
1990年第6期135-140,共6页
Journal of Huazhong University of Science and Technology
关键词
图
度序列
匹配多项式
匹配唯一
Graphs
Degree sequence
Matching polynomial
Matching uniqueness
