<?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=65354"><dc:title>The periphery graph of a median graph</dc:title><dc:creator>Brešar,	Boštjan	(Avtor)
	</dc:creator><dc:creator>Changat,	Manoj	(Avtor)
	</dc:creator><dc:creator>Subhamathi,	Ajitha R.	(Avtor)
	</dc:creator><dc:creator>Tepeh,	Aleksandra	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>median graph</dc:subject><dc:subject>Cartesian product</dc:subject><dc:subject>geodesic</dc:subject><dc:subject>periphery</dc:subject><dc:subject>peripheral expansion</dc:subject><dc:description>The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are path-like median graphs with arbitrarily large geodetic number. Peripheral expansion with respect to periphery graph is also considered, and connections with the concept of crossing graph are established.</dc:description><dc:publisher>University of Zielona Góra</dc:publisher><dc:date>2010</dc:date><dc:date>2017-03-31 14:35:28</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>65354</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
