cartesian product of graphs
基本解釋
- [數(shù)學(xué)]kneser圖笛卡爾乘積圖
- [計(jì)算機(jī)科學(xué)技術(shù)]圖的笛卡爾積
英漢例句
- In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.
本文研究正則圖的笛卡爾乘積圖與直接乘積圖的限制邊連通性。 - 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.
本文證明了路與回路的多重笛卡爾乘積的聯(lián)結(jié)數(shù)的一個(gè)定理,并給出了若干多重乘積圖的聯(lián)結(jié)數(shù)的極限性質(zhì)。
雙語(yǔ)例句
專(zhuān)業(yè)釋義
- kneser圖
- 笛卡爾乘積圖
- 圖的笛卡爾積