Sombor Index of Hypergraphs

IF 2.9 2区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY
Shashwath S Shetty, K. Arathi Bhat
{"title":"Sombor Index of Hypergraphs","authors":"Shashwath S Shetty, K. Arathi Bhat","doi":"10.46793/match.91-1.235s","DOIUrl":null,"url":null,"abstract":"Recently, the Sombor index of a graph was defined, and a large amount of study was conducted quite quickly. It has been proposed to generalise the idea of vertex degree-based topological indices from graphs to hypergraphs. We give the bounds for the Sombor index of hypergraphs and bipartite hypergraphs using the total number of vertices in the graph. Hypertrees are the connected hypergraph, where the removal of any hyperedge disconnects the hypergraph. A -uniform hypergraph is a hypergraph with k vertices in every hyperedge and a linear hypergraph is a hypergraph where any two hyperedges can have at most one vertex in common. We give the extremal hypergraphs among the class of uniform, linear and general hypertrees. The expected generalisation of some vertex degree based topological indices from graphs to hypergraphs has been listed.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"52 1","pages":"0"},"PeriodicalIF":2.9000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46793/match.91-1.235s","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, the Sombor index of a graph was defined, and a large amount of study was conducted quite quickly. It has been proposed to generalise the idea of vertex degree-based topological indices from graphs to hypergraphs. We give the bounds for the Sombor index of hypergraphs and bipartite hypergraphs using the total number of vertices in the graph. Hypertrees are the connected hypergraph, where the removal of any hyperedge disconnects the hypergraph. A -uniform hypergraph is a hypergraph with k vertices in every hyperedge and a linear hypergraph is a hypergraph where any two hyperedges can have at most one vertex in common. We give the extremal hypergraphs among the class of uniform, linear and general hypertrees. The expected generalisation of some vertex degree based topological indices from graphs to hypergraphs has been listed.
超图的Sombor索引
最近,人们定义了图的Sombor指数,并很快进行了大量的研究。提出了将基于顶点度的拓扑指标的思想从图推广到超图。利用图中顶点的总数给出了超图和二部超图的Sombor指数的界。超树是连通的超图,其中任何超边缘的移除都会断开超图的连接。-均匀超图是指在每个超边上都有k个顶点的超图,而线性超图是指任意两个超边最多有一个共同顶点的超图。给出了一类一致、线性和一般超树中的极值超图。列出了一些基于顶点度的拓扑指标从图到超图的预期推广。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.40
自引率
26.90%
发文量
71
审稿时长
2 months
期刊介绍: MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.
×
引用
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学术官方微信