<?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=67607"><dc:title>Omega polynomial revisited</dc:title><dc:creator>Diudea,	Mircea V.	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>chemical graph theory</dc:subject><dc:subject>counting polynomials</dc:subject><dc:subject>Ommega polynomial</dc:subject><dc:subject>Theta polynomial</dc:subject><dc:subject>Pi polynomial</dc:subject><dc:subject>PI index</dc:subject><dc:subject>Sadhana polynomial</dc:subject><dc:subject>Cluj-Ilmenau index</dc:subject><dc:subject>CI index</dc:subject><dc:description>Omega polynomial was proposed by Diudea (Omega Polynomial, Carpath. J. Math., 2006, 22, 43-47) to count the opposite topologically parallel edges in graphs, particularly to describe the polyhedral nanostructures. In this paper, the main definitions are re-analyzed and clear relations with other three related polynomials are established. These relations are supported by close formulas and appropriate examples.</dc:description><dc:publisher> Slovenian Chemical Society</dc:publisher><dc:date>2010</dc:date><dc:date>2017-08-24 12:12:24</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>67607</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>