On complete systems of invariants for small graphs
| dc.contributor.author | Harary, Frank | en |
| dc.contributor.author | Nikolopoulos, Stavros D. | en |
| dc.date.accessioned | 2015-11-24T17:02:53Z | |
| dc.date.available | 2015-11-24T17:02:53Z | |
| dc.identifier.issn | 0020-7160 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11108 | |
| dc.rights | Default Licence | - |
| dc.title | On complete systems of invariants for small graphs | en |
| heal.abstract | We define a small graph to be one with n ? 6 nodes. The celebrated Graph Isomorphism Problem (GIP) consists in deciding whether or not two given graphs are isomorphic, i.e., whether there is a bijective mapping from the nodes of one graph onto those of the other such that adjacency is preserved. An interesting algorithmic approach to graph isomorphism problem uses the ?code? (sometimes called a complete system of invariants). Following this approach, two graphs are isomorphic if and only if they have the same code. We propose several complete sets of invariants to settle the GIP for small graphs. Note that no complete system of invariants for a graph is known, except for those that are equivalent to the entire adjacency matrix or list of adjacencies. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | 10.1080/00207169708804573 | - |
| heal.journalName | International Journal of Computer Mathematics | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 1997 | - |
| heal.publisher | Taylor & Francis | en |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: