|
| 摘要: |
| 从生活中的一个问题出发,运用图论知识进行了分析,得到了结论,并且对结论进行了推广 得到了在一般情况下简单图含有完全子图的充分条件 并且,在度数要求方面,这个结果是最佳可能的 |
| 关键词: 简单图,完全子图,度数,极小-连通图 |
| DOI： |
| 分类号:O157.5 G633 |
| 基金项目: |
|
| A sufficient condition to decide a simple graph with a complete subgraph |
|
WANG Bin LI Xiao-min
|
| Abstract: |
| This paper starts with a problem in life, which then is translated into a question in graph theory and solved. And it generalizes the conclusion . In fact it is a sufficient condition for finding a graph with complete subgraph. The result is optimized. |
| Key words: simple graph,complete-subgraph,degree,minimal -connected graph, |
