[id] => 17
[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=16
  • A Formula for Vertex Cuts in b-Trees, ?id=143
• 4 (some):
  • Informational Entropy of b-ary Trees After a Vertex Cut, ?id=205
[file] => ?f=17
[mime] => application/pdf
[size] => 618106
[pubname] => Leonardo Electronic Journal of Practices and Technologies
[pubinfo] => AcademicDirect
[pubkey] => ISSN 1583-1078
[workinfo] => 1(1), p. 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