| 约束条件下k分支n阶图边数的最值分析 |
| |
| 引用本文： | 王娜儿. 约束条件下k分支n阶图边数的最值分析[J]. 中国水运, 2007, 5(5): 239-240 |
| |
| 作者姓名： | 王娜儿 |
| |
| 作者单位： | 浙江海洋学院数理与信息学院 |
| |
| 摘 要： | 本文给出了具有k个分支n阶无向图G(n,k∈N给定)在每个分支必须是完全图的条件下其边数的最大值和最小值,从而拓展了文献1的定理8-8.
|
| 关 键 词： | 完全图 分支 非线性规划 |
| 文章编号： | 1006-7973(2007)05-0239-02 |
| 修稿时间： | 2007-03-24 |
Max-min Value of the Number of Edges in the Graph of Order n With k Components Under some constrains |
| |
| Wang Na-er. Max-min Value of the Number of Edges in the Graph of Order n With k Components Under some constrains[J]. China Water Transport, 2007, 5(5): 239-240 |
| |
| Authors: | Wang Na-er |
| |
| Abstract: | I have given the minimum and maximum of the number of edges in graph G of order n, which is a graph with n vertices and k components and every component of G is a complete graph. It' s an extension of theorem 8-8 in article 1. |
| |
| Keywords: | complete graph component nonlinear programming |
| 本文献已被 CNKI 等数据库收录！ |
