Pregled bibliografske jedinice broj: 152522
Valence connectivity versus Randić, Zagreb and modified Zagreb index: A linear algorithm
Valence connectivity versus Randić, Zagreb and modified Zagreb index: A linear algorithm // Book of Abstracts MATH/CHEM/COMP 2004 / Graovac, Ante ; Pokrić, Biserka ; Smrečki, Vilko (ur.).
Zagreb: Institut Ruđer Bošković, 2004. (pozvano predavanje, međunarodna recenzija, sažetak, znanstveni)
CROSBI ID: 152522 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Valence connectivity versus Randić, Zagreb and modified Zagreb index: A linear algorithm
Autori
Vukičević, Damir ; Graovac, Ante
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni
Izvornik
Book of Abstracts MATH/CHEM/COMP 2004
/ Graovac, Ante ; Pokrić, Biserka ; Smrečki, Vilko - Zagreb : Institut Ruđer Bošković, 2004
Skup
MATH/CHEM/COMP 2004 - The 19th Dubrovnik International Course & Conference on the Interfaces among Mathematics, Chemistry and Computer Sciences
Mjesto i datum
Dubrovnik, Hrvatska, 21.06.2004. - 26.06.2004
Vrsta sudjelovanja
Pozvano predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
acyclic molecule; index; molecular graph; Randić; valence connectivity; Zagreb
Sažetak
Valence connectivity in molecular graphs is described by 10-tuples μ ij where μ ij denotes the number of edges connecting vertices of valences i and j. Shorter description is offered by 4-tuples containing number of vertices and values of Randić, Zagreb and modified Zagreb indices. Surprisingly, these two descriptions are in one-to-one correspondence for all acyclic molecules of practical interest, i.e. for all of them having at most 100 atoms. This result is achieved by development of an efficient algorithm which is linear in the number of 10-tuples.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Kemija
