1) strong independent number
强独立数
1.
This paper studeies the strong independent number and strong chromatic number ofgraphs.
本文研究图的强独立数及强色数问题。
2) independence reinforcement number
独立加强数
1.
To study the independence bondage number and independence reinforcement number of some graphs such as paths, complete bipartite graphs, cycles and trees, Induction method and some theorems of independence number were used.
利用归纳假设方法及图的独立数的一些定理 ,研究几类图——路、完全二分图、圈、树中的独立约束数及独立加强数 。
3) strongly independent sets
强独立集
4) data independence
数据独立
1.
Study and implementation of data independence based on DB2/400 database;
DB2/400数据库数据独立性研究与实现
2.
In order to solve the limit, this paper studies the process algbra and CSP model at first, and then extends the CSP model based on data independence.
本文在研究进程代数、CSP安全协议模型的基础上，基于数据独立技术对CSP协议模型进行扩展以解决验证的有限问题，并采用理论证明和协议验证的方式验证扩展模型的正确性和有效性。
5) independent number
独立数
1.
Method of Solving Independent Number Based on DNA Algorithm;
基于DNA算法的独立数问题的求解
2.
This paper investigates the relationship between the independent number and the upper embedability of the edge - connected simple graph and obtains the following results: (1) Let be a - edge - connected simple graph with, then is upper - embed-able; (2) Let be a 3 - edge - connected simple graph with , then is upper - embeddable.
文章讨论了边连通简单图的独立数与上可嵌入性的关系,得到了下列结果:(1)设G是一个k-边连通简 单图(k=1,2),若α(G)≤k,则G是上可嵌入的;(2)设G是一个3-边连通简单图,若α(G)≤5,则G是上可嵌入 的。
3.
In this paper,the two new sufficient conditions for Hamiltonian properties of graphs are given by the independent number a(u,v)of any pair u,v with distance 2 in G.
设 G 是 n 阶简单3-连通图,σ是 G 的最小度,u,v 是 G 的两个不相邻顶点,a(u,v)是 G 中包含 u,v 的最大独立数。
6) independent function
独立函数
1.
The radiated acoustic pressures are obtained by means of an expansion of independent functions generated by Gram - Schmidt orthonormalization using a group of spheroidal wave functions.
使用长旋转椭球函数得到一组独立函数,把声场中的声压表示为独立函数的线形叠加。
补充资料：椐椐强强
1.相随貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条