An alternative way of defining finite graphs
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
The paper presents a novel approach to graph representation, distinct from existing methods.
Before reading this…
Applications
- →graph illustration
- →isomorphism comparison
To understand this paper, make sure you know these concepts first:
- graph theoryfind papers →
- canonical forms of graphsfind papers →
Abstract
More Like ThisIn this paper we introduce "graph linear notation" -- a complete graph invariant -- which is positioned as an alternative definition for the finite graphs. This invariant is constructed using an algorithm similar to the algorithm of finding canonical forms of graphs. Storing graph linear notation instead of a regular graph allows us to greatly simplify two major problems: the construction of illustrations for graphs with regards to possible graph symmetries, and the comparison of two graphs for isomorphism. We also demonstrate the transferability to the graph linear notations such classical graph theory concepts as colourings and graph paths.