超图的Sombor索引

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-10-01 DOI:10.46793/match.91-1.235s

Shashwath S Shetty, K. Arathi Bhat

{"title":"超图的Sombor索引","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":"{\"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}","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

摘要

最近，人们定义了图的Sombor指数，并很快进行了大量的研究。提出了将基于顶点度的拓扑指标的思想从图推广到超图。利用图中顶点的总数给出了超图和二部超图的Sombor指数的界。超树是连通的超图，其中任何超边缘的移除都会断开超图的连接。-均匀超图是指在每个超边上都有k个顶点的超图，而线性超图是指任意两个超边最多有一个共同顶点的超图。给出了一类一致、线性和一般超树中的极值超图。列出了一些基于顶点度的拓扑指标从图到超图的预期推广。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Sombor Index of Hypergraphs

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

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.