hrcak mascot   Srce   HID

Izvorni znanstveni članak

The Factorisation of Chemical Graphs and Their Polynomials: A Polynomial Diyision Approach

E. C. Kirby ; Resource Use Institute, 14 Lower Oakfield, Pitlochry, Perthshire PH16 SDS, Scotland

Puni tekst: engleski, pdf (3 MB) str. 635-641 preuzimanja: 75* citiraj
APA 6th Edition
Kirby, E.C. (1986). The Factorisation of Chemical Graphs and Their Polynomials: A Polynomial Diyision Approach. Croatica Chemica Acta, 59 (3), 635-641. Preuzeto s https://hrcak.srce.hr/177292
MLA 8th Edition
Kirby, E. C.. "The Factorisation of Chemical Graphs and Their Polynomials: A Polynomial Diyision Approach." Croatica Chemica Acta, vol. 59, br. 3, 1986, str. 635-641. https://hrcak.srce.hr/177292. Citirano 26.10.2020.
Chicago 17th Edition
Kirby, E. C.. "The Factorisation of Chemical Graphs and Their Polynomials: A Polynomial Diyision Approach." Croatica Chemica Acta 59, br. 3 (1986): 635-641. https://hrcak.srce.hr/177292
Harvard
Kirby, E.C. (1986). 'The Factorisation of Chemical Graphs and Their Polynomials: A Polynomial Diyision Approach', Croatica Chemica Acta, 59(3), str. 635-641. Preuzeto s: https://hrcak.srce.hr/177292 (Datum pristupa: 26.10.2020.)
Vancouver
Kirby EC. The Factorisation of Chemical Graphs and Their Polynomials: A Polynomial Diyision Approach. Croatica Chemica Acta [Internet]. 1986 [pristupljeno 26.10.2020.];59(3):635-641. Dostupno na: https://hrcak.srce.hr/177292
IEEE
E.C. Kirby, "The Factorisation of Chemical Graphs and Their Polynomials: A Polynomial Diyision Approach", Croatica Chemica Acta, vol.59, br. 3, str. 635-641, 1986. [Online]. Dostupno na: https://hrcak.srce.hr/177292. [Citirano: 26.10.2020.]

Sažetak
Recent advances in computational methods allow the Characteristic
and Acyclic Polynomials of a Chemical Graph to be calculated easily. A consequence of this is that checking for a zero-value remainder after computer assisted polynomial division is sometimes the simplest way of testing suspected factors of a chemical graph. The technique is simple enough to apply on a routine basis when characteristic or acyclic polynomials need to be solved. Among appropriate choices for test are linear polyenes and rings, because their roots are already independently available in closed form and they do occur as factors in a significant number of structures. Examination of an arbitrary set of structures showed that the acyclic polynomials of non-cyclic structures tend to be the most easily factorisable, followed by characteristic polynomials of cyclic structures and (least easily factorisable) the
acyclic polynomials of the same cyclic structures.

Hrčak ID: 177292

URI
https://hrcak.srce.hr/177292

Posjeta: 148 *