Informational Entropy of B-ary Trees after a Vertex Cut
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 a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2008-11-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1099-4300/10/4/576/ |
| _version_ | 1811185911334961152 |
|---|---|
| author | Lorentz Jäntschi Sorana D. Bolboacă |
| author_facet | Lorentz Jäntschi Sorana D. Bolboacă |
| author_sort | Lorentz Jäntschi |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T13:38:30Z |
| format | Article |
| id | doaj.art-44ebce73d39f4967bd86f8b6921a391c |
| institution | Directory Open Access Journal |
| issn | 1099-4300 |
| language | English |
| last_indexed | 2024-04-11T13:38:30Z |
| publishDate | 2008-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Entropy |
| spelling | doaj.art-44ebce73d39f4967bd86f8b6921a391c2022-12-22T04:21:23ZengMDPI AGEntropy1099-43002008-11-0110457658810.3390/e10040576Informational Entropy of B-ary Trees after a Vertex CutLorentz JäntschiSorana D. Bolboacă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.http://www.mdpi.com/1099-4300/10/4/576/B-ary treeinformational entropyvertex cut |
| spellingShingle | Lorentz Jäntschi Sorana D. Bolboacă Informational Entropy of B-ary Trees after a Vertex Cut Entropy B-ary tree informational entropy vertex cut |
| title | Informational Entropy of B-ary Trees after a Vertex Cut |
| title_full | Informational Entropy of B-ary Trees after a Vertex Cut |
| title_fullStr | Informational Entropy of B-ary Trees after a Vertex Cut |
| title_full_unstemmed | Informational Entropy of B-ary Trees after a Vertex Cut |
| title_short | Informational Entropy of B-ary Trees after a Vertex Cut |
| title_sort | informational entropy of b ary trees after a vertex cut |
| topic | B-ary tree informational entropy vertex cut |
| url | http://www.mdpi.com/1099-4300/10/4/576/ |
| work_keys_str_mv | AT lorentzjaƒantschi informationalentropyofbarytreesafteravertexcut AT soranadbolboacaaƒ informationalentropyofbarytreesafteravertexcut |