The notion of a labelled cycle-decomposition tree for an arbitrary graph is introduced in this paper. The idea behind the labelled cycle-decomposition tree, one constructed for each vertex in the graph, is to attach to each vertex a data structure that gives more than local information about the vertex, where the data structures can be compared in polynomial time. The fact that trees can be compared in linear time, with particularly efficient algorithms for solving the isomorphism problem for rooted and labelled trees, led us to consider how we could represent the vertex's view of the graph by means of a labelled rooted tree. Of course, cycles in the graph can't be directly recorded by means of a tree structure, but in this article, we present one method for recording certain of the cycles that are encountered during a breadth-first search from the vertex in question. The collection of labelled, so-called cycle-decomposition trees for the graph, one for each vertex, provide an invariant of the graph.
Comments: 10 Pages. The labelled cycle-decomposition trees are a powerful invariant and computationally inexpensive to produce.
[v1] 2019-09-03 12:51:30
Unique-IP document downloads: 3 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.