1) perfect neighborhood set
完美邻域集
1.
For any tree T, we give an Algorithm (A) with polynomial time complexity to get the perfect neighborhood set in T.
然后给出了由T的一极大无冗余集生成完美邻域集的多项式时间复杂度算法(B),并依此算法证明了若S为T的任一极大无冗余集,则T存在一独立完美邻域集U且｜U｜≤｜S｜。
2) neighbor-integrity set
邻域完整集
3) the lower perfect neighborhood number
下完美邻域数
1.
This paper mainly discusses the lower perfect neighborhood number of graphs, gives the sufficient and necessary conditions of θ(G) = γ(G), and discusses the upper bound of the lower perfect neighborhood number of some special graphs.
本文主要讨论了图的下完美邻域数 ,并给出了θ(G) =γ(G)的充分必要条件 ,并讨论了一些特殊图类的下完美邻域数的上界 ,特别对于树采用了对所有点分层的方法进行了较细致的讨论 ,给出了紧上界θ(T)≤ [n3] 。
4) the lower perfect neighborhood number of graphs
图的下完美邻域数
1.
This thesis mainly studies three kinds of dominating parameters of graphs: the lower perfect neighborhood number of graphs, the refrained domination number of graphs and the ct-domination number of graphs, and discusses them with three respective chapters.
本文主要研究了三类图的控制参数：图的下完美邻域数、图的受限控制数和图的α控制数，并分为三章分别进行了讨论。
5) vertex-neighbor-integrity
邻域完整度
1.
It was proved by Gambrell that the decision prob- lem of computing the vertex-neighbor-integrity of a graph is NP-complete.
记幸存子图为G/X,G的邻域完整度定义为VNI(G)=min(|X|+r(G/X)},其中τ(G/X)表示G/X的最大连通分支所含顶点数。
2.
By using the quadratic integer programming method,the problem about the maximal edge number of a graph with a fixed vertex-neighbor-integrity is studied.
本文用二次整数规划法研究给定邻域完整度的图可能具有的最大边数问题。
3.
The vertex-neighbor-integrity of G is (defined) to be VNI(G)=(min)SV(G){|S+m(G/S)},where S is any vertex subversion strategy of G and m(G/S) is the maximum order of the component of G/S.
讨论了顺次联图邻域完整度的一些性质。
6) complete system of neighborhood
完全邻域组
补充资料：超导电性的局域和非局域理论（localizedandnon-localizedtheoriesofsuperconductivity）
超导电性的局域和非局域理论（localizedandnon-localizedtheoriesofsuperconductivity）
伦敦第二个方程（见“伦敦规范”）表明，在伦敦理论中实际上假定了js(r)是正比于同一位置r的矢势A(r)，而与其他位置的A无牵连；换言之，局域的A(r)可确定该局域的js(r)，反之亦然，即理论具有局域性，所以伦敦理论是一种超导电性的局域理论。若r周围r'位置的A(r')与j(r)有牵连而影响j(r)的改变，则A(r)就为非局域性质的。由于`\nabla\timesbb{A}=\mu_0bb{H}`，所以也可以说磁场强度H是非局域性的。为此，超导电性需由非局域性理论来描绘，称超导电性的非局域理论。皮帕德非局域理论就是典型的超导电性非局域唯象理论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条