<?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://repozitorij.uni-lj.si/IzpisGradiva.php?id=148033"><dc:title>On the 2-rainbow independent domination numbers of some graphs</dc:title><dc:creator>Gabrovšek,	Boštjan	(Avtor)
	</dc:creator><dc:creator>Peperko,	Aljoša	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>graph theory</dc:subject><dc:subject>rainbow independent domination number</dc:subject><dc:subject>path algebra</dc:subject><dc:subject>tropical algebra</dc:subject><dc:description>By suitably adjusting the tropical algebra technique we compute the rainbow independent domination numbers of several infinite families of graphs including Cartesian products $C_n \Box P_m$ and $C_n \Box C_m$ for all $n$ and $m\le 5$, and generalized Petersen graphs $P(n,2)$ for $n \ge 3$.</dc:description><dc:date>2023</dc:date><dc:date>2023-07-26 10:02:57</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>148033</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
