<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=66648"><dc:title>Computing the determinant and the algebraic structure count in polygraphs</dc:title><dc:creator>Graovac,	Ante	(Avtor)
	</dc:creator><dc:creator>Juvan,	Martin	(Avtor)
	</dc:creator><dc:creator>Mohar,	Bojan	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>determinant</dc:subject><dc:subject>algebraic structure count</dc:subject><dc:subject>polygraphs</dc:subject><dc:subject>acenylenes</dc:subject><dc:subject>phenylenes</dc:subject><dc:description>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.</dc:description><dc:date>1999</dc:date><dc:date>2017-07-05 08:48:57</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>66648</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
