地区配电网络路径选择的一种方法

地区网络按最小费用原则通常以带权图来描述。文章针对这些图分别用Ｋｒｕｓｋａｌ算法，Ｄｉｊｋｓｔｒａ算法及Ｆｏｒｄ＆Ｆｕｌｋｓｏｎ算法进行了优化设计。结果表明，Ｋｒｕｓｋａｌ算法偏重于网络的整体结构布局，而Ｄｉｊｋｓｔｒａ及Ｆｏｒｄ＆Ｆｕｌｋｓｏｎ算法更适合于单电源分支线路的优化路径选择。     

竞赛图中王问题的研究

本文利用现有的图论知识，证明了竞赛图中王问题的几个结果。从而对竞赛图中王问题进行了更加深入的研究。     

(0,mf-1)-图中具有某些性质的(0,f)-因子

G是一个 (0 ,mf-1 ) -图 ,其中 f是定义在V(G)上的取值 ≥ 8的偶函数 ,且G中满足dG(x) =mf(x) -1的点构成点数 ≤ 2m的独立集 ,则当m≥3时 ,G有一个 (0 ,f) -因子F含任意给定的一条边且不含任意给定的其它m -1条边 ,且使G-F是一个 (0 ,(m -1 ) f-1 ) -图 .     

多处理器互连网络诊断性和容错性的细胞图自动机算法

本文将细胞图自动机概念引入多处理器互连网络，并用细胞图自动机设计了多处理器互连网络上的多项式级诊断和容错算法，从而给出了研究互连网络诊断性和容错性的另一种有效方法。     

The Further Results of the Chromatic Uniqueness of Certain Bipartite Graphs K （m,n）- A

With its comprehensive application in network information engineering （e. g. dynamic spectrum allocation under different distance constraints ） and in network combination optimization （e. g. safe storage of deleterious materials）, the graphs＇ cloring theory and chromatic uniqueness theory have been the forward position of graph theory research. The later concerns the equivalent classification of graphs with their color polynomials and the determination of uniqueness of some equivalent classification under isomorphism. In this paper, by introducing the concept of chromatic normality and comparing the number of partitions of two chromatically equivalent graphs, a general numerical condition guarenteeing that bipartite graphs K （ m, n） - A （A belong to E（K （m, n） ） and ｜ A ｜≥ 2） is chromatically unique was obtained and a lot of chromatic uniqueness graphs of bipartite graphs K（m, n） - A were determined. The results obtained in this paper were general. And the results cover and extend the majority of the relevant results obtained within the world.