检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:GAO YAN-YAN TANG GAO-HUA CHEN JIAN-LONG
机构地区:[1]Department of Mathematics, Southeast University, Nanjing, 210096 [2]School of Mathematical Sciences, Guangxi Education University, Nanning, 530001
出 处:《Communications in Mathematical Research》2012年第4期313-323,共11页数学研究通讯(英文版)
基 金:The NSF(10971024)of China;the Specialized Research Fund(200802860024)for the Doctoral Program of Higher Education;the NSF(BK2010393)of Jiangsu Province
摘 要:The commuting graph of an arbitrary ring R, denoted by Г(R), is a graph whose vertices are all non-central elements of R, and two distinct vertices a and b are adjacent if and only if ab = ba. In this paper, we investigate the connectivity and the diameter of Г(ZnS3). We show that Г(ZnS3) is connected if and only if n is not a prime number. If Г(ZnS3) is connected then diam(Г(ZnS3)) = 3, while ifГ(ZnS3) is disconnected then every connected component of Г(ZnS3) must be a complete graph with same size, and we completely determine the vertice set of every connected component.The commuting graph of an arbitrary ring R, denoted by Г(R), is a graph whose vertices are all non-central elements of R, and two distinct vertices a and b are adjacent if and only if ab = ba. In this paper, we investigate the connectivity and the diameter of Г(ZnS3). We show that Г(ZnS3) is connected if and only if n is not a prime number. If Г(ZnS3) is connected then diam(Г(ZnS3)) = 3, while ifГ(ZnS3) is disconnected then every connected component of Г(ZnS3) must be a complete graph with same size, and we completely determine the vertice set of every connected component.
关 键 词:group ring commuting graph connected component diameter of agraph
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229