1) strong direct product of graphs
图的强直积
1.
The products of graphs discussed in this paper are the following four kinds: the Cartesian product of graphs, the tensor product of graphs, the lexicographic product of graphs and the strong direct product of graphs.
本文所讨论的积图是图的笛卡尔积，图的张量积，图的逻辑积和图的强直积四种积图。
2) weak direct product graphs
弱直积图
1.
2-distance chromatic number of weak direct product graphs
弱直积图的2-距离色数
3) direct graph
直积图
1.
Given an adjacent-vertex-distinguishing total coloring of direct graph CmCn,and obtained adjacent-vertex-distinguishing total chromatic number χ at(CmCn)=6.
给出直积图CmCn的一个邻点可区别全染色,得到其邻点可区别全色数χat(CmCn)=6。
4) strong product graphs
强乘积图
1.
Connectivity and edge-connectivity of strong product graphs;
强乘积图的连通度和边连通度(英文)
2.
Connectivity of strong product graphs;
强乘积图的连通度(英文)
5) histogram enhancement
直方图增强
1.
The cereal image enhancement techniques such as histogram enhancement,smoothing filtering and sharpening are discussed.
讨论了谷类图像增强技术中涉及到的直方图增强、平滑滤波、锐化等内容及用MAT-LAB的实现,分别给出谷类图像在各种处理前与处理后的对照图像。
6) tent anus
强直收缩图
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条