具有单位可交换环的基于理想的零因子图的Wiener索引

IF 1 4区 数学 Q1 MATHEMATICS
Balamoorthy S., Kavaskar T., Vinothkumar K
{"title":"具有单位可交换环的基于理想的零因子图的Wiener索引","authors":"Balamoorthy S., Kavaskar T., Vinothkumar K","doi":"10.1080/09728600.2023.2263040","DOIUrl":null,"url":null,"abstract":"The Wiener index of a connected graph G is W(G)=∑{u,v}⊆V(G)dG(u,v). In this paper, we obtain the Wiener index of H-generalized join of graphs G1,G2,…,Gk. As a consequence, we obtain some earlier known results in [Alaeiyan et al. in Aust. J. Basic Appl. Sci. (2011) 5(12): 145–152; Yeh et al. in Discrete Math. (1994) 135: 359–365] and we also obtain the Wiener index of the generalized corona product of graphs. We further show that the ideal-based zero-divisor graph ΓI(R) is a H-generalized join of complete graphs and totally disconnected graphs. As a result, we find the Wiener index of the ideal-based zero-divisor graph ΓI(R) and we deduce some of the main results in [Selvakumar et al. in Discrete Appl. Math. (2022) 311: 72–84]. Moreover, we show that W(ΓI(Zn)) is a quadratic polynomial in n, where Zn is the ring of integers modulo n and we calculate the exact value of the Wiener index of ΓNil(R)(R), where Nil(R) is nilradical of R. Furthermore, we give a Python program for computing the Wiener index of ΓI(Zn) if I is an ideal of Zn generated by pr, where pr is a proper divisor of n, p is a prime number and r is a positive integer with r≥2.","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"68 1","pages":"0"},"PeriodicalIF":1.0000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Wiener index of an ideal-based zero-divisor graph of commutative ring with unity\",\"authors\":\"Balamoorthy S., Kavaskar T., Vinothkumar K\",\"doi\":\"10.1080/09728600.2023.2263040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Wiener index of a connected graph G is W(G)=∑{u,v}⊆V(G)dG(u,v). In this paper, we obtain the Wiener index of H-generalized join of graphs G1,G2,…,Gk. As a consequence, we obtain some earlier known results in [Alaeiyan et al. in Aust. J. Basic Appl. Sci. (2011) 5(12): 145–152; Yeh et al. in Discrete Math. (1994) 135: 359–365] and we also obtain the Wiener index of the generalized corona product of graphs. We further show that the ideal-based zero-divisor graph ΓI(R) is a H-generalized join of complete graphs and totally disconnected graphs. As a result, we find the Wiener index of the ideal-based zero-divisor graph ΓI(R) and we deduce some of the main results in [Selvakumar et al. in Discrete Appl. Math. (2022) 311: 72–84]. Moreover, we show that W(ΓI(Zn)) is a quadratic polynomial in n, where Zn is the ring of integers modulo n and we calculate the exact value of the Wiener index of ΓNil(R)(R), where Nil(R) is nilradical of R. Furthermore, we give a Python program for computing the Wiener index of ΓI(Zn) if I is an ideal of Zn generated by pr, where pr is a proper divisor of n, p is a prime number and r is a positive integer with r≥2.\",\"PeriodicalId\":48497,\"journal\":{\"name\":\"AKCE International Journal of Graphs and Combinatorics\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AKCE International Journal of Graphs and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/09728600.2023.2263040\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AKCE International Journal of Graphs and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09728600.2023.2263040","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

连通图G的Wiener指数为W(G)=∑{u,v}≥v (G)dG(u,v)。本文得到了图G1,G2,…,Gk的h -广义连接的Wiener索引。因此,我们在澳大利亚的[Alaeiyan等人]中获得了一些早期已知的结果。J.基本苹果。科学。(2011) 5(12): 145-152;《离散数学》中的Yeh等人。(1994) 135: 359-365]并得到了图的广义电晕积的Wiener指数。进一步证明了基于理想的零因子图ΓI(R)是完全图和完全不连通图的h -广义连接。因此,我们找到了基于理想的零因子图ΓI(R)的Wiener索引,并推断了[Selvakumar等人在Discrete appll中的一些主要结果。数学。[j].科学通报,2016,31(2):1 - 4。此外,我们表明,W(Γ我(锌))是一个二次多项式在n,其中锌是整数环模n和我们计算的精确值Γ零维纳指数(R) (R)的Nil (R)是nilradical R .此外,我们给一个Python程序计算的维纳指数Γ我(锌)产生的锌是一种理想的公关,公关是一个合适的除数的n, p是一个质数,R和R≥2是一个正整数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Wiener index of an ideal-based zero-divisor graph of commutative ring with unity
The Wiener index of a connected graph G is W(G)=∑{u,v}⊆V(G)dG(u,v). In this paper, we obtain the Wiener index of H-generalized join of graphs G1,G2,…,Gk. As a consequence, we obtain some earlier known results in [Alaeiyan et al. in Aust. J. Basic Appl. Sci. (2011) 5(12): 145–152; Yeh et al. in Discrete Math. (1994) 135: 359–365] and we also obtain the Wiener index of the generalized corona product of graphs. We further show that the ideal-based zero-divisor graph ΓI(R) is a H-generalized join of complete graphs and totally disconnected graphs. As a result, we find the Wiener index of the ideal-based zero-divisor graph ΓI(R) and we deduce some of the main results in [Selvakumar et al. in Discrete Appl. Math. (2022) 311: 72–84]. Moreover, we show that W(ΓI(Zn)) is a quadratic polynomial in n, where Zn is the ring of integers modulo n and we calculate the exact value of the Wiener index of ΓNil(R)(R), where Nil(R) is nilradical of R. Furthermore, we give a Python program for computing the Wiener index of ΓI(Zn) if I is an ideal of Zn generated by pr, where pr is a proper divisor of n, p is a prime number and r is a positive integer with r≥2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.00
自引率
10.00%
发文量
40
审稿时长
28 weeks
期刊介绍: AKCE International Journal of Graphs and Combinatorics is devoted to publication of standard original research papers in Combinatorial Mathematics and related areas. The fields covered by the journal include: Graphs and hypergraphs, Network theory, Combinatorial optimization, Coding theory, Block designs, Combinatorial geometry, Matroid theory, Logic, Computing, Neural networks and any related topics. Each volume will consist of three issues to be published in the months of April, August and December every year. Contribution presented to the journal can be Full-length article, Review article, Short communication and about a conference. The journal will also publish proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standard of the journal.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信