Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/11108
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHarary, Franken
dc.contributor.authorNikolopoulos, Stavros D.en
dc.date.accessioned2015-11-24T17:02:53Z-
dc.date.available2015-11-24T17:02:53Z-
dc.identifier.issn0020-7160-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11108-
dc.rightsDefault Licence-
dc.titleOn complete systems of invariants for small graphsen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primary10.1080/00207169708804573-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate1997-
heal.abstractWe 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.publisherTaylor & Francisen
heal.journalNameInternational Journal of Computer Mathematicsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
nikolopoulos-1997-On complete systems of invariants for small.pdf521.32 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons