1) unique perfect matching
唯一完美匹配
1.
In this paper,we characterize the saturated graph G having unique perfect matching with level(G) = 0 and give the sharp upper bound of the number of lines of the D-graph D(G) of the graphs with unique perfect matching.
本文中,我们刻画了level(G)=0的具有唯一完美匹配的饱和图G,并且确定了具有唯一完美匹配图的D-图的边数的紧上界。
2) matching unique
匹配唯一
1.
A graph G is called to be matching unique if the graph G is determinde by μ(G,x).
如果图G由它的匹配多项式γ(G,x)唯一确定称图G匹配唯一。
2.
It was pointed out that the graph G was matching unique only if its complement graph G was matching unqiue.
指出了图G是匹配唯一的当且仅当它的补图G是匹配唯一的 并给出了一个二分图G与它的完全二分补图G的匹配多项式之间的关
3) matching uniqueness
匹配唯一
1.
In this paper,we prove that for T(1,4,n)and its complement is matching uniqueness if and only if n≠4,7,13 by the property of Graph s matching polynomial and its maximum root.
利用图的匹配多项式及其最大实数根的性质证明了树T(1,4,n)及其补图匹配唯一的充要条件是n≠4,7,13。
4) perfect matching
完美匹配
1.
Minimum degree distance of unicyclic graphs with perfect matching;
具最小度距离的完美匹配单圈图
2.
On the second largest Laplacian eigenvalues of trees with nearly perfect matchings;
关于几乎完美匹配树的第二大Laplacian特征值(英文)
3.
Enumeration of perfect matchings in some type polyminoes;
若干四角系统完美匹配数的计算
5) matching uniqueness
匹配唯一性
1.
The matching uniqueness of T shape tree with nearly equal length;
几乎等长T形树的匹配唯一性
2.
The matching uniqueness of T(1,3,n)∪(∪ CP_i form i=0 to S)and its complement;
T(1,3,n)∪(∪ CP_i form i=0 to S)及补图的匹配唯一性
3.
In this paper,we have discussed the matching uniqueness of graphs and proved that T(3,4,n)∪(∪si=0Cpi)(n4) and its complement are matching unique if and only if n≠4,9.
研究了图的匹配唯一性,给出了T(3,4,n)∪(s∪i=0Cpi)(n 5)及补图匹配唯一的充要条件。
6) matching unque
匹配唯一的
1.
In the paper,the properties of matching polynomial and matching unque,and Y-graph is not matching unque,and matching polynomial of snake tree and ring graph,ets.
文章主要研究特殊图的匹配多项式唯一的性质,得到了星图为匹配唯一的、蛇树和轮环图的匹配多项式及Y形图不是匹配唯一的等结论。
补充资料：唯一
1.唯独;独一无二。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条