基于图运算下的控制熵

Domination entropy based on graph operations

图不变量广泛应用于构建基于熵的度量以表征复杂网络的结构。特别地,基于控制集的图熵常应用于刻画通信系统的信息量和计算机网络的稳定性。研究完全图、星图、梳状图和友谊图在不交的并、联图、冠积和笛卡尔积4种图运算下基于控制集的图熵计算。

Graph invariants are widely used to construct entropy-based metrics to characterize the structure of complex networks.In particular,graph entropy based on dominating sets is often applied to characterize the amount of information in communication systems and the stability of computer networks.Graph entropy calculations are studied based on dominating sets under the four operations of graphs.That is the operations of the disjoint union,joining,corona product,and Cartesian product using the complete graph,star graph,comb graph,and friendship graph.