关于图运算的基于度的图熵  

Degree-based graph entropy on graph operations

作　　者：吴传书 赵海兴[2,3] 邓波 WU Chuan-shu;ZHAO Hai-xing;DENG Bo(College of Mathematics and Statistics,Qinghai Normal University,Xining 810008,Qinghai,China;College of Computer,Qinghai Normal University,Xining 810008,Qinghai,China;The State Key Laboratory of Tibetan Intelligent Information Processing and Application,Xining 810008,Qinghai,China)

机构地区：[1]青海师范大学数学与统计学院,青海西宁810008 [2]青海师范大学计算机学院,青海西宁810008 [3]藏语智能信息处理及应用国家重点实验室,青海西宁810008

出　　处：《山东大学学报（理学版）》2022年第6期44-53,共10页Journal of Shandong University(Natural Science)

基　　金：高等学校学科创新引智计划资助(D20035);青海省藏文信息处理与机器翻译重点实验室(2020-ZJ-Y05)。

摘　　要：研究在对称差、笛卡尔积、张量积、冠积运算下的基于度的图熵计算,以及运用这些结果来计算纳米结构和超立方体分子图的基于度的图熵。Graph invariants are widely used to construct entropy-based metrics to describe the structures of complex networks. In particular, graph entropy based on vertex degrees is often used to measure graph structure information after graph operations.The degree-based graph entropy calculation on some graph operations containing the symmetric difference, Cartesian product, tensor product, Corona product of graphs are presented. These results are applied to calculate the degree-based graph entropy of molecular graphs such as nano-structure and hypercubes.

关 键 词：图运算 图熵 香农熵 顶点度 分子图 

分 类 号：O157.5[理学—数学]