{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:41:20Z","timestamp":1760244080660,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2008,11,3]],"date-time":"2008-11-03T00:00:00Z","timestamp":1225670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e10040576","type":"journal-article","created":{"date-parts":[[2008,11,3]],"date-time":"2008-11-03T11:49:43Z","timestamp":1225712983000},"page":"576-588","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Informational Entropy of B-ary Trees after a Vertex Cut"],"prefix":"10.3390","volume":"10","author":[{"given":"Lorentz","family":"J\u00e4ntschi","sequence":"first","affiliation":[{"name":"Technical University of Cluj-Napoca, 103-105 Muncii Bvd, 400641 Cluj-Napoca, Cluj, Romania"},{"name":"\"Iuliu Ha\u0163ieganu\" University of Medicine and Pharmacy Cluj-Napoca, Department of Medical Informatics and Biostatistics, 6 Louis Pasteur, 400349 Cluj-Napoca, Cluj, Romania"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2342-4311","authenticated-orcid":false,"given":"Sorana  D.","family":"Bolboac\u0103","sequence":"additional","affiliation":[{"name":"Technical University of Cluj-Napoca, 103-105 Muncii Bvd, 400641 Cluj-Napoca, Cluj, Romania"},{"name":"\"Iuliu Ha\u0163ieganu\" University of Medicine and Pharmacy Cluj-Napoca, Department of Medical Informatics and Biostatistics, 6 Louis Pasteur, 400349 Cluj-Napoca, Cluj, Romania"}]}],"member":"1968","published-online":{"date-parts":[[2008,11,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1010836331703","article-title":"Stochastic inference of regular tree languages","volume":"44","author":"Carrasco","year":"2001","journal-title":"Mach. Learn."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00440-006-0036-z","article-title":"A subdiffusive behaviour of recurrent random walk in random environment on a regular tree","volume":"138","author":"Hu","year":"2007","journal-title":"Probab. Theory. Relat. Fields."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0020-0190(98)00172-0","article-title":"Computing the relative entropy between regular tree languages","volume":"68","author":"Carrasco","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1214\/aoap\/1060202828","article-title":"Information flow on trees","volume":"13","author":"Mossel","year":"2003","journal-title":"Ann. Appl. Probab."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0022-247X(91)90149-T","article-title":"Random walk covering of some special trees","volume":"157","author":"Aldous","year":"1991","journal-title":"J. Math. Anal. Appl."},{"key":"ref_6","first-page":"17","article-title":"A Formula for Vertex Cuts in b-Trees","volume":"47","author":"Stoenoiu","year":"2008","journal-title":"Int. J. Pure App. Math."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cplett.2007.03.098","article-title":"Statistical-mechanical approach to subgraph centrality in complex networks","volume":"439","author":"Estrada","year":"2007","journal-title":"Chem. Phys. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A Mathematical Theory of Communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell. Syst. Techn. J."},{"key":"ref_9","first-page":"841","article-title":"Energie informationelle","volume":"263","author":"Onicescu","year":"1966","journal-title":"Compt. Rend. Acad. Sci. Paris Ser."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1038\/163688a0","article-title":"Measurement of Diversity","volume":"163","author":"Simpson","year":"1949","journal-title":"Nature"},{"key":"ref_11","first-page":"1617","article-title":"Statistical Assessment of Solvent Mixture Models used for Separation of Biological Active Compounds","volume":"8","author":"Cimpoiu","year":"2008","journal-title":"Molecules"},{"key":"ref_12","unstructured":"Friedman, W. F. (1922). The Index of Coincidence and Its Applications in Cryptography, Riverbanks Publication."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/0025570X.1986.11977212","article-title":"Solving a Jules Verne Cryptogram","volume":"59","author":"Gass","year":"1986","journal-title":"Mathem. Mag."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2944","DOI":"10.1109\/18.959272","article-title":"Inequalities between entropy and index of coincidence derived from information Diagrams","volume":"47","author":"Harremoes","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_15","unstructured":"R\u00e9nyi, A. On measures of information and entropy. Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1016\/0167-8655(94)90107-4","article-title":"Informational similarity of graphs in syntactic pattern recognition","volume":"15","author":"Jumarie","year":"1994","journal-title":"Pattern Recogn. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0022-1694(96)03092-2","article-title":"Informational entropy of fractal river networks","volume":"187","author":"Claps","year":"1996","journal-title":"J. Hydrol."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cep.2007.03.001","article-title":"Kinetic equation of grinding process in mixing of granular material using probability density functions, transient operators and informational entropy","volume":"47","author":"Masiuk","year":"2008","journal-title":"Chem. Eng. Process"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.powtec.2006.05.011","article-title":"Energy and population balances in comminution process modelling based on the informational entropy","volume":"167","author":"Otwinowski","year":"2006","journal-title":"Powder Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1021\/ci950077k","article-title":"Correlation of Entropy with Similarity and Symmetry","volume":"36","author":"Lin","year":"1996","journal-title":"J. Chem. Inf. Comput. Sci."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/10\/4\/576\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:21:07Z","timestamp":1760221267000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/10\/4\/576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,3]]},"references-count":20,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2008,12]]}},"alternative-id":["e10040576"],"URL":"https:\/\/doi.org\/10.3390\/e10040576","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2008,11,3]]}}}