本文首先把图中任二点之间的最短链仅有一条者定义为唯一最短链图。
First of all, this paper gives a definition of the unique shortest chain graph (U. S. C. graph).
内在链图和内在纽结图是近年来比较新的一个研究领域,也是空间图中的两类重要的图。
In recent years, intrinsically linked and intrinsically knotted graphs, as very important graphs in spatial graphs, are becoming targets of some relatively new research areas.
采用光子与电子(正电子)的最小电磁耦合模型,获得了光子链图传播子重整化的有限量。
In the minimum electromagnetismcoupling model of interaction between photonand electron(antielectron), we obtain the renormalization finite quantity of photon chain propagator.
应用推荐