Graph Operations Decreasing Values of Degree-Based Graph Entropies

IF 2.9 2区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2022-08-01 DOI:10.46793/match.89-2.405y
Jingzhi Yan, Feng Guan
{"title":"Graph Operations Decreasing Values of Degree-Based Graph Entropies","authors":"Jingzhi Yan, Feng Guan","doi":"10.46793/match.89-2.405y","DOIUrl":null,"url":null,"abstract":"The degree-based graph entropy Id is a parametric measure derived from an information functional defined by vertex degrees of a graph, which is used to characterize the structure of complex networks. Determining minimal values of Id is challenging due to a lack of effective methods to analyze properties of minimal graphs. In this paper, we investigate minimal properties of the graph entropy in (n, m)-graphs and define two new graph operations, which can decrease the values of Id.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":null,"pages":null},"PeriodicalIF":2.9000,"publicationDate":"2022-08-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":"92","ListUrlMain":"https://doi.org/10.46793/match.89-2.405y","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

The degree-based graph entropy Id is a parametric measure derived from an information functional defined by vertex degrees of a graph, which is used to characterize the structure of complex networks. Determining minimal values of Id is challenging due to a lack of effective methods to analyze properties of minimal graphs. In this paper, we investigate minimal properties of the graph entropy in (n, m)-graphs and define two new graph operations, which can decrease the values of Id.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于度的图熵递减值的图运算
基于度的图熵Id是由图的顶点度定义的信息函数衍生而来的参数度量,用于表征复杂网络的结构。由于缺乏有效的方法来分析最小图的性质,确定最小图的最小值是具有挑战性的。本文研究了(n, m)-图中图熵的最小性质,并定义了两种新的图熵运算,它们可以减小图熵的值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
ChemCNet: An Explainable Integrated Model for Intelligent Analyzing Chemistry Synthesis Reactions Asymptotic Distribution of Degree-Based Topological Indices Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs Sombor Index of Hypergraphs The ABC Index Conundrum's Complete Solution
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1