施永兵.关于简单MCD图的几个定理[J].数学研究及应用,1991,11(4):551~554 |
关于简单MCD图的几个定理 |
Some Theorems on Simple MCD-Graphs |
投稿时间:1989-12-22 |
DOI:10.3770/j.issn:1000-341X.1991.04.016 |
中文关键词: |
英文关键词: |
基金项目: |
|
摘要点击次数: 1992 |
全文下载次数: 847 |
中文摘要: |
|
英文摘要: |
A graph G is said to be a simple cycle-distributed graph if G is a simple graph in which no two cycles have the same length. A graph G is said to be a simple maximum cycle-distributed graph (simple MCD-graph) if G is a simple cycle-distributed graph on n vertices which has the maximum possible number of edges. In this paper, we prove that ( 1 ) None of 2-connected non-planar graphs is a simple MCD-graph; ( 2) For each positive integer n(?){10, 11, 14, 15, 16, 21, 22}, there does not exist a simple MCD-graph on n verticas such that it is a 2-connected graph containing a subgraph homeomorphic to K4. |
查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|