Lorentz JÄNTSCHI (lori) works ?id=137
- [id] => 137
- [recorddate] => 2007:08:19:19:04:54
- [lastupdate] => 2007:08:19:19:04:54
- [type] => conference
- [place] => Plovdiv, Bulgaria
- [subject] => chemistry - computational; informatics - fundamentals; mathematics - applied; mathematics - number theory
- [relatedworks] =>
- 2 (average):
- Graph theory. 1. Fragmentation of structural graphs, ?id=18
- Graph theory. 2. Vertex descriptors and graph coloring, ?id=19

- 4 (some):
- Informational entropy of b-ary trees after a vertex cut, ?id=175

- [file] => ?f=137
- [mime] => application/pdf
- [size] => 163811
- [pubname] => Fourth International Conference of Applied Mathematics and Computing, August 12-18, 2007
- [pubinfo] => University of Chemical Technology and Metallurgy Sofia & Technical University of Plovdiv
- [pubkey] => Short communication, presented on August 15, from 12.10 to 12.20
- [workinfo] => p. 233
- [year] => 2007
- [title] => A formula for vertex cuts in b-trees
- [authors] => Lorentz JÄNTSCHI, Carmen E. STOENOIU, Sorana D. BOLBOACĂ
- [abstract] =>

The paper presents a polynomial formula giving the number and size of substructures that result after removing of one vertex from a b-tree.

The solution proposed for this problem is presented by using of a polynomial formula. Two particular cases are presented.

The obtained polynomial formulas for vertex cuts in b{}-trees can be generalized, allowing calculations of any structures of interest. The obtained formula works also as limit formulas for trivial trees, which are paths.
- [keywords] => Graph theory; B-tree; Polynomial formula
- [acknowledgment] => This research was partly funded by UEFISCSU Romania. First author thank to Prof. Mircea V. DIUDEA
from “Babes-Bolyai” University for the helpful discussions on topics related to the subject, counting polynomials on square matrices.