Naslov
An algorithm for determining graph isomorphism

Autori
Sedlar, Jelena

Vrsta, podvrsta i kategorija rada
Poglavlja u knjigama, znanstveni

Knjiga
Mathematical Methods and Modelling for Students of Chemistry and Biology

Urednik/ci
Graovac, Ante ; Gutman, Ivan ; Vukičević, Damir

Izdavač
Hum naklada

Grad
Zagreb

Godina
2009

Raspon stranica
143-155

ISBN
978-953-6954-40-7

Ključne riječi
isomorphism, automorphism, graph invariant

Sažetak
In order to analyse and solve many problems in chemistry, molecules are modelled with mathematical objects called graphs. But the problem is that the many different graphs can model the same molecule. Since properties which we study and analyse are attributed to molecules, it is quite important to distinguish whether two graphs represent the same molecule or not. Therefore, the notion of isomorphism of graphs is introduced, and the problem of determining isomorphism of graphs arises. The purpose of this paper is to present the fastest algorithm known to date for solving that problem.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Kemija, Građevinarstvo

POVEZANOST RADA