This article is
- freely available
Informational Entropy of B-ary Trees after a Vertex Cut
Technical University of Cluj-Napoca, 103-105 Muncii Bvd, 400641 Cluj-Napoca, Cluj, Romania
"Iuliu Haţieganu" University of Medicine and Pharmacy Cluj-Napoca, Department of Medical Informatics and Biostatistics, 6 Louis Pasteur, 400349 Cluj-Napoca, Cluj, Romania
* Author to whom correspondence should be addressed.
Received: 24 September 2008; in revised form: 15 October 2008 / Accepted: 27 October 2008 / Published: 3 November 2008
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
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
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.
Jäntschi L, Bolboacă SD. Informational Entropy of B-ary Trees after a Vertex Cut. Entropy. 2008; 10(4):576-588.
Jäntschi, Lorentz; Bolboacă, Sorana D. 2008. "Informational Entropy of B-ary Trees after a Vertex Cut." Entropy 10, no. 4: 576-588.