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
Entropy 2008, 10(4), 576-588; doi:10.3390/e10040576
Article

Informational Entropy of B-ary Trees after a Vertex Cut

1,2,*  and 1,2
1 Technical University of Cluj-Napoca, 103-105 Muncii Bvd, 400641 Cluj-Napoca, Cluj, Romania 2 "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 / Revised: 15 October 2008 / Accepted: 27 October 2008 / Published: 3 November 2008
View Full-Text   |   Download PDF [321 KB, uploaded 24 February 2015]   |   Browse Figures

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 B-ary tree; informational entropy; vertex cut
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
SciFeed

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
RIS
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.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert