Entropy 2008, 10(4), 576-588; doi:10.3390/e10040576
Article

Informational Entropy of B-ary Trees after a Vertex Cut

1,2,* email and 1,2email
Received: 24 September 2008; in revised form: 15 October 2008 / Accepted: 27 October 2008 / Published: 3 November 2008
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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.
Keywords: B-ary tree; informational entropy; vertex cut
PDF Full-text Download PDF Full-Text [321 KB, uploaded 3 November 2008 15:07 CET]

Export to BibTeX |
EndNote


MDPI and ACS Style

Jäntschi, L.; Bolboacă, S.D. Informational Entropy of B-ary Trees after a Vertex Cut. Entropy 2008, 10, 576-588.

AMA Style

Jäntschi L, Bolboacă SD. Informational Entropy of B-ary Trees after a Vertex Cut. Entropy. 2008; 10(4):576-588.

Chicago/Turabian Style

Jäntschi, Lorentz; Bolboacă, Sorana D. 2008. "Informational Entropy of B-ary Trees after a Vertex Cut." Entropy 10, no. 4: 576-588.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert