1) product graph
积图
1.
On the vertex-distinguishing edge colorings of some product graphs;
若干积图的点可区别边染色
2.
The edge chromatic number and the vertex-distinguishing edge chromatic number of some product graphs were studied in this paper.
通过研究若干n重积图的边色数及点可区别边色数,就可证明■(Gi)=△(Gi),i=1,2,L,n,则∑=′×××=■△(G_i)其中G1×G2×L×Gn为G1,G2,L,Gn的n重积图。
3.
The connectivity of the product graph is studied,and a new lower bound of the connectivity of the product graph is obtained.
研究了积图的点连通度,并给出了积图点连通度的一个新的下界:设Gm和Gp分别是构成积图Gm*Gp的主图与模型图,若Gm是一个有m个点的连通图,则κ(Gm*Gp)≥min{mκ(Gp),δ(Gp)+1}。
2) product graphs
积图
1.
The K-gracefulness on the subdivision graph of the product graphs Ps and Ct;
关于积图P_s×C_t的细分图的K-优美性
2.
In this paper,two theorem about the adjacent strong edge chromatic number of product graphs are given.
给出了积图邻强边色数的两个定理。
3) 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.
It is proved that for any graphs G and H, independence number of product of graphs is greater than or equal to product of β(G) and β(H),i.
证明任意两个图G和H的积图G×H的独立数不小于这两个图的独立数之积,即β(G×H)≥β(G)×β(H);任意两个图G和H的积图G×H的上无赘数不小于这两个图的上无赘数之积,即IR(G×H)≥IR(G)×IR(H)。
4) integration by graph
图解积分
1.
The computer statistical calculation of the molecular concentration of citric acid in the aquatic phase after extraction has been compared with the integration by graph and the logarithm graphing.
采用图解积分法和对数函数与萃取后水相中柠檬酸分子浓度的计算机统计运算法进行比较，得到两种处理结果的相对误差在３％以内。
5) Sphygrnogram area
波图面积
6) isointegral map
等积分图
1.
A comparative study was made of departure maps, peak potential map, isochrone map, isointegral map in BSPM and ECG in 42 patients with MI using a BSPM Ⅲmodel computer system.
目的 :比较体表电位标测 (BSPM)各种图形与心电图 (ECG)诊断心肌梗死 (MI)的敏感性 ,方法采用 BSPM- 型体表电位标测微机系统 ,对 42例 MI患者和健康人的体表差电位图、峰电位图、等时间图、等积分图及 ECG进行了对比研究。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条