Graph Operations Decreasing Values of Degree-Based Graph Entropies
-
Published:2022-08
Issue:2
Volume:89
Page:405-414
-
ISSN:0340-6253
-
Container-title:MATCH Communications in Mathematical and in Computer Chemistry
-
language:
-
Short-container-title:MATCH
Author:
Yan Jingzhi, ,Guan Feng,
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.
Publisher
University Library in Kragujevac
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications,General Chemistry
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献