Product graphs 产品图表
weak direct product graphs 弱直积图
Cartesian product of graphs 图的直积 ; 图的笛卡尔积
direct product graphs 直接乘积图
the Cartesian product of graphs 笛卡尔积图 ; 图的笛卡尔积
That is our one major success. If you look at the other graphs, you can see that most of the other product lines remained steady with little increase.
这是我们最大的成功之一。看一下其他图表，你还会看到我们其他产品的销售曲线大多保持稳定，略有增长。
In this paper, a theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
Aim To solve the induced matching cover problem of some graphs, such as the product of two paths and the nontrivial tree.
目的解决某些图类的导出匹配覆盖问题，特别是两条路的乘积图和非平凡树。
应用推荐