- 更多网络例句与平凡图相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.
从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。
- 更多网络解释与平凡图相关的网络解释 [注：此内容来源于网络，仅供参考]
-
trivial graph：平凡图
trivial fibre bundle 平凡纤维丛 | trivial graph 平凡图 | trivial homogeneous ideal 平凡齐次理想
-
trivial homogeneous ideal：平凡齐次理想
trivial graph 平凡图 | trivial homogeneous ideal 平凡齐次理想 | trivial knot 平凡纽结
-
trivial fibre bundle：平凡纤维丛
trivial extension 平凡扩张 | trivial fibre bundle 平凡纤维丛 | trivial graph 平凡图