hrcak mascot   Srce   HID

Izvorni znanstveni članak

On Symmetry of Some Non-transitive Chemical Graphs

Gorban Ali Moghani
Ali Reza Ashrafi

Puni tekst: engleski, pdf (353 KB) str. 465-469 preuzimanja: 826* citiraj
APA 6th Edition
Ali Moghani, G. i Ashrafi, A.R. (2006). On Symmetry of Some Non-transitive Chemical Graphs. Croatica Chemica Acta, 79 (3), 465-469. Preuzeto s https://hrcak.srce.hr/5655
MLA 8th Edition
Ali Moghani, Gorban i Ali Reza Ashrafi. "On Symmetry of Some Non-transitive Chemical Graphs." Croatica Chemica Acta, vol. 79, br. 3, 2006, str. 465-469. https://hrcak.srce.hr/5655. Citirano 08.03.2021.
Chicago 17th Edition
Ali Moghani, Gorban i Ali Reza Ashrafi. "On Symmetry of Some Non-transitive Chemical Graphs." Croatica Chemica Acta 79, br. 3 (2006): 465-469. https://hrcak.srce.hr/5655
Harvard
Ali Moghani, G., i Ashrafi, A.R. (2006). 'On Symmetry of Some Non-transitive Chemical Graphs', Croatica Chemica Acta, 79(3), str. 465-469. Preuzeto s: https://hrcak.srce.hr/5655 (Datum pristupa: 08.03.2021.)
Vancouver
Ali Moghani G, Ashrafi AR. On Symmetry of Some Non-transitive Chemical Graphs. Croatica Chemica Acta [Internet]. 2006 [pristupljeno 08.03.2021.];79(3):465-469. Dostupno na: https://hrcak.srce.hr/5655
IEEE
G. Ali Moghani i A.R. Ashrafi, "On Symmetry of Some Non-transitive Chemical Graphs", Croatica Chemica Acta, vol.79, br. 3, str. 465-469, 2006. [Online]. Dostupno na: https://hrcak.srce.hr/5655. [Citirano: 08.03.2021.]

Sažetak
The automorphism group of a chemical graph has to be generated for computer-aided structure elucidation. A Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i ≠ j, dij is the Euclidean distance between the nuclei i and j. In this matrix, dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. A. T. Balaban introduced some monster graphs and then M. Randić computed complexity indices for them. This paper describes a simple method, by means of which it is possible to calculate the automorphism group of weighted graphs.

Ključne riječi
weighted graph; Euclidean graph

Hrčak ID: 5655

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

Posjeta: 1.095 *