Lorentz JÄNTSCHI (lori) works ?id=100
- [id] => 100
- [recorddate] => 2007:01:14:16:44:38
- [lastupdate] => 2007:01:14:17:18:26
- [type] => conference
- [place] => Cluj-Napoca, Romania
- [subject] => informatics - fundamentals; mathematics - algebra; mathematics - modeling; mathematics - number theory
- [relatedworks] =>
- 3 (low):
- A formula for vertex cuts in b-trees, ?id=170

- 4 (some):
- Entropy and energy of substructures obtained by vertex cutting in regular trees, ?id=182
- Counting polynomials on regular iterative structures, ?id=194

- [file] => ?f=100
- [mime] => application/pdf
- [size] => 3678938
- [pubname] => TOPMOL2006 - 20 Years Anniversary of Molecular Topology at Cluj
- [pubinfo] => Babes-Bolyai University
- [pubkey] => CEEx M3 PR-D11-PT00-41
- [workinfo] => p. 16 [Plenary oral presentation], September 25-30
- [year] => 2006
- [title] => Subgraphs by pairs of vertices
- [authors] => Lorentz JÄNTSCHI, Mircea V. DIUDEA
- [abstract] =>

Subgraphs which result through applying of matrix criterions of fragmentation were investigated. Two well known matrix criterions (Szeged and Cluj), and two others are defined and characterized through properties. An example graph was used to show the procedure of subgraphs obtaining. The graph polynomial for number of vertices of subgraphs was also investigated for the general case and polynomials for the given example were calculated. The new introduced criterions, called MaxF and CMaxF shows to have very interesting properties.
- [keywords] => Subgraphs; Chemical Graph Theory; Graph Polynomials
- [acknowledgment] => Thanks from one author (LJ) to Prof. Dr. Istvan LUKOVITS for the helpful post-conference discussions.