几类亚随意匹配图

孟吉翔

您当前的位置：

首页 >

文章列表页 >

几类亚随意匹配图

更新时间：2026-01-21

- 几类亚随意匹配图
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Issue 1, (1984)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1984
- 稿件说明：
移动端阅览
[1]孟吉翔.几类亚随意匹配图[J].新疆大学学报(自然科学版),1984(01):14-17.

孟吉翔. 几类亚随意匹配图[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1984, (1).
[1]孟吉翔.几类亚随意匹配图[J].新疆大学学报(自然科学版),1984(01):14-17. DOI：

孟吉翔. 几类亚随意匹配图[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1984, (1). DOI：

摘要

David P.Sumner在[1]中引入了随意匹配图的概念;如果图G的任意匹配都能扩充为G的完备匹配

则称G为随意匹配图.他证明了当且仅当G为

Abstract

A graph is defined to be hypomatchable if every matching of G can be extended to a maximum matching of G. The matching ratio of G

denoted by m(G)

isa'(G)/{v/2}

where a'(G)denotes the number of edges in a maximum matching of G. In this Paper We give some classes of hypomatch- able graphs and show that for any rational numberγ

where 0

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰