排序方式: 共有2条查询结果,搜索用时 0 毫秒
1
1.
The Hamiltonian path graph H(G) of a graph G isa that graph having the samevertex set as G and in which two vertices u and v are adjacent if and only if Gcontains a Hamiltonian u - v path. A graph G is a self-Hamiltonian path graph ifG≌H(G).G. Chartrand conjecture: A graph G of order p is a self-Hamiltonian path:graph if and only if G is chord additive or G is isomorphic to one of the graphsK_p, (?)_p, C_p(p≥3),K((1/2)p, (1/2)p), and K_(p/2) (?)_(p/2),the last two for even P. 相似文献
2.
叶有培 《数学年刊A辑(中文版)》1984,(5)
本文首先给出Z[x],+,o)的所有极大理想和(Z[x],+,·,o)的所有极大完备理想,证明J_2(Z[x],+,o)=0,然后根据Clay和Doi定义的由本质极小N-群决定的N的Jacobson根,证明生成的子加群,以及J_2(Z_2[x],+,o)=J(Z_2[x],+,o),这样完全解决域F上多项式Near-环的Jaeobson根的问题。 相似文献
1