| K-桥图的本原指标 |
| |
| 引用本文： | 欧阳克智,孙宁. K-桥图的本原指标[J]. 西安工程科技学院学报, 2005, 19(2): 214-216 |
| |
| 作者姓名： | 欧阳克智 孙宁 |
| |
| 作者单位： | 西安石油大学理学院,陕西西安710065 |
| |
| 摘 要： | K-桥图是由连接A，B两点的K条内部不交路所组成的图．计算得到本原K-桥图的本原指标等于m-1或n-1，其中m是最大奇圈的圈长，而n是A，B间最长奇路(偶路)与最短偶路(奇路)的长度之和．
|
| 关 键 词： | 本原图 K-桥图 本原指标 |
| 文章编号： | 1671-850X(2005)02-0214-03 |
| 修稿时间： | 2004-09-27 |
The primitive index about K-bridge graphs |
| |
| OUYANG Ke-zhi,SUN Ning. The primitive index about K-bridge graphs[J]. Journal of Xi an University of Engineering Science and Technology, 2005, 19(2): 214-216 |
| |
| Authors: | OUYANG Ke-zhi SUN Ning |
| |
| Abstract: | K-bridge graph is a graph composed of K internally-disjotint paths connecting two vertices A and B.Primitive index of primitive K-bridge graph is calculated.It equals either m-1 or n-1,here m is length of the longest odd-cycle,n is sum of the lengthes of the longest odd-path (even-path) and the shortest even-path (odd-path) between A and B. |
| |
| Keywords: | primitive graph K-bridge graph primitive index |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
