排序方式: 共有7条查询结果,搜索用时 15 毫秒
1
1.
2.
A graph is called a proper refinement of a star graph if it is a refinement of a star graph, but it is neither a star graph
nor a complete graph. For a refinement of a star graph G with center c, let G
c
* be the subgraph of G induced on the vertex set V (G)\ {c or end vertices adjacent to c}. In this paper, we study the isomorphic classification of some finite commutative local rings R by investigating their zero-divisor graphs G = Γ(R), which is a proper refinement of a star graph with exactly one center c. We determine all finite commutative local rings R such that G
c
* has at least two connected components. We prove that the diameter of the induced graph G
c
* is two if Z(R)2 ≠ {0}, Z(R)3 = {0} and G
c
* is connected. We determine the structure of R which has two distinct nonadjacent vertices α, β ∈ Z(R)* \ {c} such that the ideal [N(α) ∩ N(β)]∪ {0} is generated by only one element of Z(R)*\{c}. We also completely determine the correspondence between commutative rings and finite complete graphs K
n
with some end vertices adjacent to a single vertex of K
n
. 相似文献
3.
令R为有限交换局部环,M表其唯一的极大理想,k表其剩余类域.本文定出了R上的一般线性群GLnR,辛群Sp2nR及双曲正交群O2nR的Sylow子群.一般讲,若charx=p,上述三类典型群的Sylow p-子群分别同构于由某些特殊形式的矩阵生成的子群;若chark≠p,上述三类典型群的Sylowp-子群分别同构于一循环群或半二面体群与若干Zp型循环群的圈积。 相似文献
4.
5.
Polynomial functions (in particular, permutation polynomials) play an important role in the design of modern cryptosystem. In this note the problem of counting the number of polynomial functions over finite commutative rings is discussed. Let A be a general finite commutative local ring. Under a certain condition, the counting formula of the number of polynomial functions over A is obtained. Before this paper, some results over special finite commutative rings were obtained by many authors. 相似文献
6.
令R为有限交换局部环,K为其剩余类域.本文研究了R上一般线性群GLnR的Carter子群的存在性及结构.得到的结果是:若charK为奇数或K=F2,GLnR中存在唯一的Carter子群的共轭类,即Sylow-2子群的正规化子;若charK=2且|K|>2,GLnR中不含Carter子群. 相似文献
7.
1