APA 6th Edition Kirby, E.C. (1997). Compiling an Adjacency Matrix of an Arbitrary Structure. Croatica Chemica Acta, 70 (3), 873-882. Preuzeto s https://hrcak.srce.hr/135654
MLA 8th Edition Kirby, E. C.. "Compiling an Adjacency Matrix of an Arbitrary Structure." Croatica Chemica Acta, vol. 70, br. 3, 1997, str. 873-882. https://hrcak.srce.hr/135654. Citirano 28.02.2021.
Chicago 17th Edition Kirby, E. C.. "Compiling an Adjacency Matrix of an Arbitrary Structure." Croatica Chemica Acta 70, br. 3 (1997): 873-882. https://hrcak.srce.hr/135654
Harvard Kirby, E.C. (1997). 'Compiling an Adjacency Matrix of an Arbitrary Structure', Croatica Chemica Acta, 70(3), str. 873-882. Preuzeto s: https://hrcak.srce.hr/135654 (Datum pristupa: 28.02.2021.)
Vancouver Kirby EC. Compiling an Adjacency Matrix of an Arbitrary Structure. Croatica Chemica Acta [Internet]. 1997 [pristupljeno 28.02.2021.];70(3):873-882. Dostupno na: https://hrcak.srce.hr/135654
IEEE E.C. Kirby, "Compiling an Adjacency Matrix of an Arbitrary Structure", Croatica Chemica Acta, vol.70, br. 3, str. 873-882, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/135654. [Citirano: 28.02.2021.]
Sažetak An experimental project on which work continues intermittently is the development of an interactive Personal-Computer program to assist in the capture of connectivity information about an arbitrary chemical graph of moderate size. (By arbitrary we mean one that does not fall, or is not recognized as falling, into a class which has useful symmetries or easily applicable analytic formulae to provide short cuts.) The approach is to deal with a graphics-screen image using a small set of tools, in the hope of being able to obtain a connection table faster and with a smaller risk of errors than by manual methods alone. It is applicable both to planar structures and to non-planar ones that have been cut to give a 2D representation.