Informational Entropy of B-ary Trees after a Vertex Cut

Entropy

Lorentz Jäntschi¹ 

[1] Technical University of Cluj-Napoca, 103-105 Muncii Bvd, 400641 Cluj-Napoca, Cluj, Romania.Phone: [phone]. Fax: [phone]. E-mail:

关键词: B-ary tree;    informational entropy;    vertex cut;   

DOI  :  10.3390/e10040576

来源: mdpi

【 摘 要 】

Together with stars and paths, b-ary trees are one of the most studied acyclic graph structures. As any other structure, a b-ary tree can be seen as containing information. The aim of the present research was to assess through informational entropy the structural information changes in b-ary trees after removal of an arbitrary vertex.

【 授权许可】

CC BY   
© 2008 by the authors; licensee Molecular Diversity Preservation International, Basel, Switzerland.