1) nonseparable graph
不可分图
2) nonseparable maps
不可分地图
1.
In this paper,the chromatic sum function equations is given for rooted nonseparable maps on the sphere and the projective plane.
给出了球面和射影平面上带根不可分地图的色和方程,从色和方程导出了球面和射影平面上带根一般不可分地图、二部地图的计数函数方程。
3) irreducible graph
不可约图
1.
In this paper, it has shown that P n is irreducible graph if and only if n+1 is prime when n≥4 .
用Pn 表示n阶的路 ,证明了n≥ 4时 ,Pn 是不可约图当且仅当n + 1是素数 ,从而得出若干新的色惟一图 。
4) divisible graph
可分图
1.
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.
本文讨论了两个可分图的张量乘积图的同构因子分解问题。
5) separated graphic
可分图形
6) unretractive graph
不可收缩图
1.
Graphs and their endomorphism semigroups are considered and the characterization of E-S unretractive graphs is given in this paper.
本文考虑了图及其自同态半群，给出了Ｅ—Ｓ不可收缩图的结构刻划。
补充资料：不可分
见“可分与不可分”(25页)。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条