<?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=49383"><dc:title>Characterizing posets for which their natural transit functions coincide</dc:title><dc:creator>Brešar,	Boštjan	(Avtor)
	</dc:creator><dc:creator>Changat,	Manoj	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Mathews,	Joseph	(Avtor)
	</dc:creator><dc:creator>Mathews,	Antony	(Avtor)
	</dc:creator><dc:creator>Narasimha-Shenoi,	Prasanth G.	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>tranzitna funkcija</dc:subject><dc:subject>rangirana delno urejena množica</dc:subject><dc:subject>temeljni graf</dc:subject><dc:subject>geodetski interval</dc:subject><dc:subject>interval induciranih poti</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>transit function</dc:subject><dc:subject>ranked poset</dc:subject><dc:subject>underlying graph</dc:subject><dc:subject>geodesic interval</dc:subject><dc:subject>induced-path interval</dc:subject><dc:subject/><dc:description>Standardna tranzitna funkcija delno urejene množice ▫$P$▫ je funkcija ▫$T_P$▫, ki vsakemu paru primerljivih elementov priredi interval med njima, za neprimerljiva elementa ▫$x,y$▫ pa je ▫$T_P(x,y) = {x,y}$▫. Na tri načine, tudi s prepovedanimi delno urejenimi podmnožicami, okarakteriziramo tiste delno urejene množice, v katerih standardna tranzitna funkcija sovpada s tranzitno funkcijo najkrajših poti njenega grafa pokritij-neprimerljivosti.</dc:description><dc:date>2009</dc:date><dc:date>2015-07-10 12:01:25</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>49383</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
