图的最小完整度  

Minimum Integrity of Graphs

作　　者：马润年[1] 刘乃功[2] 

机构地区：[1]西安交通大学理学院 [2]空军工程大学理学院,西安710051

出　　处：《数学物理学报（A辑）》2006年第2期251-257,共7页Acta Mathematica Scientia

基　　金：中国博士后科学基金(2003033516);大连大学信息科学与工程辽宁省高校重点实验室资助

摘　　要：主要研究了图的完整度,并给出若干关于完整度的结果．对于所有的顶点数和边数都给定的连通图类,如何确定该图类中完整度最小的图．同时研究了对于顶点数和完整度都给定的连通图类,如何确定该图类中边数最多的图的问题．这些结果为图的最小完整度的优化设计提供了理论和方法．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.

关 键 词：图论 完整度 最小完整度 

分 类 号：O157[理学—数学]