1) The Path-Positive Property On the Products of Graphs
积图的道路正性
2) path-positive graph
道路正图
1.
It is proved that: (1)The cartesian product,the lexicographic product and the strong direct product in the products of connected graphs, are the path-positive graphs.
证明了：（1）如果G1和G2都是连通图，则积图中笛卡尔积，逻辑积和强直积都是道路正图。
3) the product of path and cycle graphs
路与圈的积图
1.
The problem of(d,1)-total labeling number for the product of path and cycle graphs is studied,and some results of(d,1)-total labeling number for the product of path and cycle graphs are obtained.
研究了路与圈的积图的(d,1)-全标号问题,并给出了路与圈的积图的(d,1)-全标号数。
6) road cumulated dust
道路积尘
1.
[Objective]To investigate inorganic element pollution status in road cumulated dust in Wusong industry and nearby areas.
[目的]了解上海市吴淞工业区及周边地区道路积尘中无机元素的污染状况。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条