数论  

出　　处：《中国学术期刊文摘》2008年第3期18-18,共1页Chinese Science Abstracts(Chinese Edition)

摘　　要：极小子群的中心化子与群的P-可解性；复合图Pm[G]的邻域完整度；有向网络中无环最小饱和流问题及其算法；广义Ramanujan—Nagell方程x^2＋D^m=P^n的解的注记;两个丢番图方程y^2=nx（x^2±1）……The centralizers of minimal subgroups and p-solvability of finite groups; Vertex-neighbor-integrity of composition graph Pm[G]; Minimum saturated flow problem in directed network and its algorithm;A note on the solutions of the generalized Ramanujan-Nagell equation x^2＋ D^m=P^n ; A note on two diophantine equations y^2=nx（x^2± 1）……

关 键 词：数论 邻域完整度 最小饱和流 丢番图方程 极小子群 有向网络 可解性 

分 类 号：O156.4[理学—数学] O156[理学—基础数学]