<?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=65339"><dc:title>Isomorphic components of Kronecker product of bipartite graphs</dc:title><dc:creator>Jha,	Pranava	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Zmazek,	Blaž	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>Kronecker graph product</dc:subject><dc:subject>bipartite graphs</dc:subject><dc:subject>graph isomorphism</dc:subject><dc:description>Weichsel (Proc. Amer. Math. Soc. 13 (1992), 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.</dc:description><dc:date>1997</dc:date><dc:date>2017-03-31 11:30:04</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>65339</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
