| 寻找欧拉生成子图最大边数的一个方法 |
| |
| 引用本文： | 李登信.寻找欧拉生成子图最大边数的一个方法[J].重庆工商大学学报(自然科学版),2007,24(3):215-217. |
| |
| 作者姓名： | 李登信 |
| |
| 作者单位： | 重庆工商大学理学院,重庆400067 |
| |
| 摘 要： | 设G是超欧拉图,X是G的子图.在G中,把X的点收缩为一个点vX,去掉X的边,得到G关于子图X的收缩,记为G/X.引入a—子图的概念,得到了若干a—子图,并表明如何利用a—子图来寻找欧拉生成子图的最大边数.
|
| 关 键 词： | 欧拉生成子图 收缩 边数 |
| 文章编号： | 1672-058X（2007）03-0215-03 |
| 收稿时间： | 2007-03-13 |
| 修稿时间： | 2007-03-132007-04-28 |
A method to find maximum number of edges in a spanning Eulerian subgraph |
| |
| LI Deng-xin.A method to find maximum number of edges in a spanning Eulerian subgraph[J].Journal of Chongqing Technology and Business University:Natural Science Edition,2007,24(3):215-217. |
| |
| Authors: | LI Deng-xin |
| |
| Institution: | School of Science, Chongqing Technology and Business University, Chongqing 400067, China |
| |
| Abstract: | Suppose G is Eulerian graph,X is the subgraph of Gv,in G,the point of X is contracted to a point vxv,if the edges of X are removed,the contraction of subgraph X of G is arrived at and is noted as G/X.The concept of a-subgraph is introduced,a lot of a-subgraphs are obtained accordingly.How to use a-subgraph to find maximum number of edges of spanning Eulerian subgraphs is demonstrated. |
| |
| Keywords: | spanning Eulerian subgraph contraction number of edges |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆工商大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆工商大学学报(自然科学版)》下载免费的PDF全文 |
|
