Next Article in Journal
Entropy 2008, 10, 240-247: Ferri et al. Deformed Generalization of the Semiclassical Entropy
Previous Article in Journal
Assessing the Information Content in Environmental Modelling: A Carbon Cycle Perspective
Open AccessArticle

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.
Entropy 2008, 10(4), 576-588;
Received: 24 September 2008 / Revised: 15 October 2008 / Accepted: 27 October 2008 / Published: 3 November 2008
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. View Full-Text
Keywords: B-ary tree; informational entropy; vertex cut B-ary tree; informational entropy; vertex cut
Show Figures

Graphical abstract

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.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Search more from Scilit
Back to TopTop