Skoči na glavni sadržaj

Izvorni znanstveni članak

Computing the Determinant and the Algebraic Structure Count in Polygraphs

Ante Graovac ; Rugjer Bošković Institute, HR–10001 Zagreb, P.O.B. 1016, Croatia
Martin Juvan ; Department of Mathematics, University of Ljubljana, Jadranska 19, SI–1111, Ljubljana, Slovenia
Bojan Mohar ; Department of Mathematics, University of Ljubljana, Jadranska 19, SI–1111, Ljubljana, Slovenia
Janez Žerovnik ; Faculty of Mechanical Engineering, University of Maribor, Smetanova 17, SI–2000 Maribor, Slovenia


Puni tekst: engleski pdf 128 Kb

str. 853-867

preuzimanja: 339

citiraj


Sažetak

An algorithm for computing the algebraic structure count in polygraphs is presented. It expresses the related determinant of the adjacency matrix of a polygraph in terms of the determinants of monographs and bonding edges between the monographs. The algorithm is illustrated on a class of polygraphs with two bonding edges between monographs and computations for selected examples of polygraphs of this class are presented.

Ključne riječi

determinant; algebraic structure count; polygraphs; acenylenes; phenylenes

Hrčak ID:

132304

URI

https://hrcak.srce.hr/132304

Datum izdavanja:

1.12.1999.

Posjeta: 896 *