1) independence number
独立数
1.
Relations among some independence numbers of a uniform hypergraph and its complementary hypergraph;
一致超图与其补超图各种独立数间的关系
2.
Equivalence of a local and a global independence number conditions;
局部独立数与全局独立数条件的等价性
3.
Based on the analysis of two important variables-independence number and connectivity,the characterization is given to the structure of graph G when its independence number α(G)=1,2 or 3,and its connectivity κ(G)is taken over all possible values,respectively.
通过对图的两个重要不变量——独立数和连通度的分析,分别给出了图G的独立数α(G)=1,2或3,而连通度κ(G)任意取值时图G的结构特征。
2) 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 的最大独立数。
3) 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协议模型进行扩展以解决验证的有限问题，并采用理论证明和协议验证的方式验证扩展模型的正确性和有效性。
4) 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.
使用长旋转椭球函数得到一组独立函数,把声场中的声压表示为独立函数的线形叠加。
5) 3-independence number
3-独立数
6) edge independence number
边独立数
1.
A note on the spectrum and the edge independence number of a graph;
图的谱与边独立数的一点注记
2.
Spectral radius of unicyclic graphs given order and edge independence number
给定阶和边独立数的单圈图的谱半径
3.
In this paper,the following results are obtained:if T is a tree on 2 q +1 vertices with the edge independence number q ,when q≥2,λ q (T) ≤λ q (K q 1,q ) ,and the equality holds if and only if TK q 1,q ,λ q (K q 1,q ) =1.
设 Ｋｑ１ ，ｑ 为 Ｋ１ ，ｑ 的ｑ 个悬挂点各接出１ 条悬挂边而得的２ ｑ ＋ １ 阶树， 又若 Ｔ 是边独立数为 ｑ 的２ ｑ ＋ １ 阶树， 则 ｑ ≥２ 时有： ①λｑ （ Ｔ） ≤λｑ （ Ｋｑ１ ，ｑ） ， 等号成立当且仅当 Ｔ Ｋｑ１ ，ｑ ； ②λｑ （ Ｋｑ１ ，ｑ） ＝ １ 。
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条