The cover pebbling number for lexicographic product graphs and some strong product graphs were determined.
对一个图而言，满足此条件的最小的自然数即为此图的覆盖数。
In this paper, we discuss isomorphic factorization for tensor product of two divisible graphs and prove the conditions for the tensor product graphs to be factorized isomorphically.
本文讨论了两个可分图的张量乘积图的同构因子分解问题。
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.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
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.
这是我们最大的成功之一。看一下其他图表，你还会看到我们其他产品的销售曲线大多保持稳定，略有增长。
Aim To solve the induced matching cover problem of some graphs, such as the product of two paths and the nontrivial tree.
目的解决某些图类的导出匹配覆盖问题，特别是两条路的乘积图和非平凡树。
Moreover, we determine the toughness of the product of two complete graphs.
还给出了两个完全图乘积的坚韧度。
In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.
本文研究正则图的笛卡尔乘积图与直接乘积图的限制边连通性。
Bipartite graphs with P-regular endomorphism monoids are characterized. P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed.
刻划了具有P -正则自同态幺半群的二分图，讨论了字典序积图的自同态幺半群的P -正则性。
In addition, properties on local cuts and generalized cuts in these two kinds of product of graphs are also considered.
此外，对这两种积的局部割集和广义割集的性质也进行了考虑。
In addition, properties on local cuts and generalized cuts in these two kinds of product of graphs are also considered.
此外，对这两种积的局部割集和广义割集的性质也进行了考虑。
应用推荐