1) P_3-factor
P_3-因子
1.
A graph G has a P_3-factor if G has a spanning subgraph each component of which is a path on three vertices.
如果图G有一个生成子图使得这个生成子图的每一个分支都是3个点的路,则称G有P_3-因子。
2) path graphs P 3(G)
路图P_3(G)
3) P_3-dominated graph
P_3-支配图
1.
In this paper, we prove that a 2-connected P_3-dominated graph of order n is traceable if NC≥(n - 2)/2.
称G是P_3-支配图(P3D),如果对于G中每一对距离为2的点(x,y)它都满足J(x,y)∪J\'(x,y)≠φ。
2.
The class of P_3-dominated graphs was introduced recently in[3].
在文献[3]中介绍了一个新的图类—P_3-支配图。
4) P_3-hamiltonian graph
P_3-Hamilton图
6) P 3 Hamiltonian property
P_3-Hamilton连通性
补充资料：Ⅷ因子缺乏病
Ⅷ因子缺乏病
factor Ⅷ deficiency
即“血友病A”。见“血友病A”。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条