%0 Journal Article
%T Minimum Integrity of Graphs<br>图的最小完整度
%A Ma Runnian
%A Liu Naigong
%A <br>马润年
%A 刘乃功
%J 数学物理学报(A辑)
%D 2006
%I 
%X 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.
%K Graph theory
%K Integrity
%K Minimum integrity<br>图论
%K 完整度
%K 最小完整度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=4DB553CDB5F521D8C921082E5C95EC80&aid=5FF01379A975B7B6&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=0B39A22176CE99FB&sid=4B1FFFA116F7AE3B&eid=4290346F7268639E&journal_id=1003-3998&journal_name=数学物理学报(A辑)&referenced_num=0&reference_num=8