| 图的最小完整度 |
| |
| 引用本文： | 马润年,刘乃功.图的最小完整度[J].数学物理学报(A辑),2006,26(2):251-257. |
| |
| 作者姓名： | 马润年 刘乃功 |
| |
| 作者单位： | 西安交通大学理学院，空军工程大学理学院 西安 710049 大连大学信息科学与工程辽宁省高校重点实验室 大连 116622，西安 710051 |
| |
| 基金项目： | 中国博士后科学基金(2003033516)，大连大学信息科学与工程辽宁省高校重点实验室资助 |
| |
| 摘 要： | 主要研究了图的完整度,并给出若干关于完整度的结果. 对于所有的顶点数和边数都给定的连通图类,如何确定该图类中完整度最小的图. 同时研究了对于顶点数和完整度都给定的连通图类,如何确定该图类中边数最多的图的问题. 这些结果为图的最小完整度的优化设计提供了理论和方法.
|
| 关 键 词： | 图论 完整度 最小完整度 |
| 文章编号： | 1003-3998(2006)02-251-07 |
| 收稿时间： | 2003-12-08 |
| 修稿时间： | 2005-10-22 |
Minimum Integrity of Graphs |
| |
| Ma Runnian,Liu Naigong.Minimum Integrity of Graphs[J].Acta Mathematica Scientia,2006,26(2):251-257. |
| |
| Authors: | Ma Runnian Liu Naigong |
| |
| Institution: | School of Science, Xi'an Jiaotong University, Xi'an 710049
University Key Lab of Information Sciences and Engineering, Dalian University, Dalian 116622
|
| |
| Abstract: | The integrity of a graph is mainly studied and some results on the integrity are given. Given the number of vertices and the number of edges in a class of graphs, the problem of how to determine a graph that has the minimum integrity among the class is studied. Also, if the number of vertices and the integrity in a class of graphs are fixed, the problem of how to determine a graph that has the maximum number of edges among them is investigated. For the optimal designs of the minimal integrity, the theoretics and methods are provided. |
| |
| Keywords: | Graph theory Integrity Minimum integrity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学物理学报(A辑)》浏览原始摘要信息 |
| 点击此处可从《数学物理学报(A辑)》下载免费的PDF全文 |
