Lorentz JÄNTSCHI and Sorana D. BOLBOACA (2008) Informational Entropy of b-ary Trees After a Vertex Cut

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

Informational Entropy of b-ary Trees After a Vertex Cut

Post a Comment

CONTRIBUTORS:

	Author:	Lorentz JÄNTSCHI (Technical University of Cluj-Napoca)
	Author:	Sorana D. BOLBOACA (Iuliu Hatieganu University of Medicine and Pharmacy Cluj-Napoca)

JOURNAL:

Entropy, 10(4), 576 - 588.

YEAR:

2008

PUB TYPE:

Journal Article

SUBJECT(S):

chemistry - computational; informatics - fundamentals; mathematics - algebra; mathematics - modeling

DISCIPLINE:

Mathematics

HTTP:

http://lori.academicdirect.org/works/?f=205

LANGUAGE:

English

PUB ID:

103-446-152 (Last edited on 2008/11/06 08:39:45 US/Mountain)

SPONSOR(S):

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.

STATISTICS

Click on # to view
Citations		0
References		2
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		1/191

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next