Topological code of graphs (Q1188076)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Topological code of graphs |
scientific article; zbMATH DE number 40038
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Topological code of graphs |
scientific article; zbMATH DE number 40038 |
Statements
Topological code of graphs (English)
0 references
3 August 1992
0 references
The aim of this paper is to associate a numerical code to a finite, symmetric, nonreflexive graph, used to identify isomorphic graphs. One starts with the adjacency matrix of the graph, then relabels the vertices by a standard procedure. What is here meant by topological code is this new adjacency matrix, used to identify the isomorphism class of the graph. An interactive program based on these steps is described, but the lack of details makes difficult any efficiency judgement.
0 references
isomorphic graphs
0 references
topological code
0 references
adjacency matrix
0 references
