<?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=65340"><dc:title>Median and quasi-median direct products of graphs</dc:title><dc:creator>Brešar,	Boštjan	(Avtor)
	</dc:creator><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>median graph</dc:subject><dc:subject>direct product</dc:subject><dc:subject>quasi-median graph</dc:subject><dc:subject>isometric embeddings</dc:subject><dc:subject>convexity</dc:subject><dc:description>Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of ▫$G \times P_3$▫ is median if and only if ▫$G$▫ is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form ▫$G \times K_2$▫ are proved, and it is shown that the only nonbipartite quasi-median direct product is ▫$K_3 \times K_3$▫.</dc:description><dc:date>2005</dc:date><dc:date>2017-03-31 11:36:33</dc:date><dc:type>Neznano</dc:type><dc:identifier>65340</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
