几类亚随意匹配图

本文在文献2]至5]的基础上构造了几类更广泛的亚随意匹配图.文中未说明的术语见1].定义1 设 G 是在 n+1(n≥0)阶星图中的每个悬挂点 u_i 上构造一个 G_i 所得到的图,其中G_i 是由有唯一公共点 u_i 的 s_i 个偶数

Some Classes of Hypomatchable Graphs

A graph is called hypomatchable if every matching of G can be extended to a maximum matching of G.In this paper it has been constructed and pro- ved that the emphatic star-graph and the emphatic star-wheel-graph are both hypomatchable graphs.At the same same time it has been also proved that if G is a graph which is constructed by 2n-1 G_i circuits of 4 orders,2 n G_i and 2H_r,where G_i is an empatic star-wheel-graph with U_i as its wheel center and H_r is an emphatic star-wheel-graph with v_r as its wheel vertex, then G is hypomatchable.