1) Product graph
乘积图
1.
In this paper, we study the arboricity of a family graph: product graph.
研究了乘积图的荫度并对一般的图G ,H ,给出了其乘积图G×H 荫度上界 。
2.
By using the decomposition theorem for the fill-in of graphs,we can decomposite the strong product of graphs together with product graph,and obtain the fill-in number of them.
运用图的最优填充分解定理,将强乘积图P3 Pn,P2 Pn与乘积图P2×P2n进行分解,得到了它们的最优填充数。
3.
In this paper,this conjecture is confirmed by a number of cartesion product graphs and tensor product graphs on path, cycle and complete graphs.
本文对路、圈、完全图的若干笛卡尔乘积图和张量乘积图证实了猜想是正确的。
2) product graphs
乘积图
1.
The following result was obtained:if two direct graphs were(weakly) vertex-transitive,then their product graphs were(weakly) vertex-transitive.
对有向图的四类乘积图的点传递性质进行了研究,得到了有向(弱)点传递图的四类乘积图保持(弱)点传递的性质。
2.
The product graphs of Cayley graphs of semigroups are considered.
证明了半群Cayley图的乘积图仍是半群Cayley图。
3.
This paper studied equitable chromatic numbers of several product graphs and proved the graphs are equitably k-colorable where k≥2 or 3.
考虑了几类乘积图的均匀着色数,证明了这几类乘积图可均匀k-着色(k≥2或3)。
3) Cartesian product graphs
乘积图
1.
We preliminarily investigate some general rules of the fractional coloring of Cartesian product graphs,which are composed of Hamilton,2-partite,and Ga,b graph,etc.
文中通过讨论由Hamilton圈、二部图、Ga,b等图构造的Cartesian乘积图的分数染色,初步研究了Cartesian乘积图分数染色的一般规律。
4) product of sound map
乘积声图
5) strong product graphs
强乘积图
1.
Connectivity and edge-connectivity of strong product graphs;
强乘积图的连通度和边连通度(英文)
2.
Connectivity of strong product graphs;
强乘积图的连通度(英文)
6) product graph L_m×K_n
乘积图Lm×Kn
1.
In this paper,we determine the vertex strong total chromatic number χ~~(vs)__T(G) of general graph K(n,m) of complete graph K_n and product graph L_m×K_n.
本文确定了完全图Kn的广义图K(n,m)和乘积图Lm×Kn的点强全色数。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条