Distance based topological descriptors for two classes of graphs

K. Pattabiraman
{"title":"Distance based topological descriptors for two classes of graphs","authors":"K. Pattabiraman","doi":"10.37193/CMI.2019.02.07","DOIUrl":null,"url":null,"abstract":"In this paper, the exact formula for the generalized product degree distance, reciprocal product degree distance and product degree distance of\nMycielskian graph and its complement are obtained. In addition, we compute the above indices for non-commuting graph.","PeriodicalId":112946,"journal":{"name":"Creative Mathematics and Informatics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Creative Mathematics and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37193/CMI.2019.02.07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, the exact formula for the generalized product degree distance, reciprocal product degree distance and product degree distance of Mycielskian graph and its complement are obtained. In addition, we compute the above indices for non-commuting graph.
两类图的基于距离的拓扑描述符
本文给出了mycielskian图及其补的广义积度距离、互积度距离和积度距离的精确公式。此外,我们还计算了非交换图的上述指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信