Lorentz JÄNTSCHI (lori) works ?id=19
- [id] => 19
- [recorddate] => 2007:01:12:20:41:29
- [lastupdate] => 2007:01:12:20:41:29
- [type] => article
- [place] => www, Internet
- [subject] => chemistry - computational; informatics - fundamentals; mathematics - applied
- [relatedworks] =>
- 2 (average):
- Graph theory. 1. Fragmentation of structural graphs, ?id=18
- A formula for vertex cuts in b-trees, ?id=137

- 4 (some):
- Informational entropy of b-ary trees after a vertex cut, ?id=175
- Extending characteristic polynomial from graphs to molecules, ?id=303

- [file] => ?f=19
- [mime] => application/pdf
- [size] => 618106
- [pubname] => Leonardo Electronic Journal of Practices and Technologies
- [pubinfo] => AcademicDirect
- [pubkey] => ISSN 1583-1078
- [workinfo] => 1(1): 37-52
- [year] => 2002
- [title] => Graph theory. 2. Vertex descriptors and graph coloring
- [authors] => Lorentz JÄNTSCHI
- [abstract] =>

This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.
- [keywords] => Graph theory; Vertex descriptors; Matrix based descriptors; Invariants; Graph coloring; Graph partitioning