{"title":"关于半局部环的零因子图和补图的连通性","authors":"Subhash Mallinath Gaded, Nithya Sai Narayana","doi":"10.26524/cm156","DOIUrl":null,"url":null,"abstract":"Zero-divisor graphs have been a key area of focus for many researchers. For the semi local ring R of finite cartesian product of finite fields, we consider the zero divisor graph of R denoted by Γ(R) with vertex set as the non-zero zero-divisors of R where two vertices u and v are adjacent if and only if the product of u and v is the additive identity of the Ring R. The objective of this paper is to determine the number of cut vertices and cut edges, vertex connectivity and edge connectivity of the zero divisor graph Γ(R) and complement graph Γ(R).","PeriodicalId":414198,"journal":{"name":"Journal of Computational Mathematica","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On Connectivity of Zero-Divisor Graphs and Complement Graphs of some Semi-Local Rings\",\"authors\":\"Subhash Mallinath Gaded, Nithya Sai Narayana\",\"doi\":\"10.26524/cm156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Zero-divisor graphs have been a key area of focus for many researchers. For the semi local ring R of finite cartesian product of finite fields, we consider the zero divisor graph of R denoted by Γ(R) with vertex set as the non-zero zero-divisors of R where two vertices u and v are adjacent if and only if the product of u and v is the additive identity of the Ring R. The objective of this paper is to determine the number of cut vertices and cut edges, vertex connectivity and edge connectivity of the zero divisor graph Γ(R) and complement graph Γ(R).\",\"PeriodicalId\":414198,\"journal\":{\"name\":\"Journal of Computational Mathematica\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Mathematica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26524/cm156\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Mathematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26524/cm156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
零因子图一直是许多研究者关注的一个关键领域。有限半局部环R的笛卡儿积的有限领域,我们认为R的零因子图用Γ(R)与顶点集的非零zero-divisors R u和v两个顶点在哪里附近当且仅当u和v的产物是添加剂的身份环R .本文的目的是确定减少顶点和边的数量,零因子图的顶点连接和边缘连接Γ(R)和补充图Γ(R)。
On Connectivity of Zero-Divisor Graphs and Complement Graphs of some Semi-Local Rings
Zero-divisor graphs have been a key area of focus for many researchers. For the semi local ring R of finite cartesian product of finite fields, we consider the zero divisor graph of R denoted by Γ(R) with vertex set as the non-zero zero-divisors of R where two vertices u and v are adjacent if and only if the product of u and v is the additive identity of the Ring R. The objective of this paper is to determine the number of cut vertices and cut edges, vertex connectivity and edge connectivity of the zero divisor graph Γ(R) and complement graph Γ(R).