|
|||||
|
|
| 关于图的边邻域完整度若干问题的研究 | |
| 引用本文： | 麦安婵. 关于图的边邻域完整度若干问题的研究[J]. 西安工程科技学院学报, 2005, 19(2): 220-223 |
| 作者姓名： | 麦安婵 |
| 作者单位： | 西安陆军学院数学教研室,陕西西安710108 |
| 摘 要： | 用二次规划法研究图的边邻域完整度．分析图的边邻域完整度给定条件下图可能具有的最大、最小边数问题;讨论图与其破边子图的边邻域完整度之间的关系;给出圈及圈的平方的边邻域完整度． |
| 关 键 词： | 图或网络的脆弱性 邻域完整度 边邻域完整度 二次规划 |
| 文章编号： | 1671-850X(2005)02-0220-04 |
| 修稿时间： | 2004-09-10 |
Research on the edge-neighbor-integrity of a graph |
|
| MAI An-chan. Research on the edge-neighbor-integrity of a graph[J]. Journal of Xi an University of Engineering Science and Technology, 2005, 19(2): 220-223 | |
| Authors: | MAI An-chan |
| Abstract: | By use of the method of quadratic programming, the problem that the maximum and minmum edges (number) of a graph with a fixed edge-neighbor-(integrity) was analysed.The relationship between the edge-neighbor-(integrity) of the graph and its subgraph (was) studied. The edge-neighbor-integrity of cycles and the power of cycles (was) given. |
| Keywords: | the " vulnerability" of graphs or networks,vertex-neighbor-integrity,edge-neighbor-integrity,(quadratic) programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |