Some graph invariants related to the distance matrix of a digraph

dc.contributor.author	Seibert, Jaroslav
dc.contributor.author	Skálová, Magdalena
dc.contributor.author	Trojovský, Pavel
dc.date.accessioned	2010-05-14T09:14:19Z
dc.date.available	2010-05-14T09:14:19Z
dc.date.issued	2009
dc.identifier	Univerzitní knihovna (studovna)	cze
dc.identifier.issn	1211-555X
dc.identifier.uri	http://hdl.handle.net/10195/35697
dc.description.abstract	It is the very usual case that the sbortest paths between all pairs of vertices in a given graph are required. Then the distance matrix D of such graph has to be arranged. In addition some quantities related to the distance matrix D can be useful. The program in the system Mathematica was created to calculate specific quantities for a given directed graph. Further the determinant of the distance matrix and the distance polynomial for a cycle with n vertices were found.	eng
dc.format	p. 164-171	eng
dc.language.iso	eng
dc.publisher	Univerzita Pardubice	cze
dc.relation.ispartof	Scientific papers of the University of Pardubice. Series D, Faculty of Economics and Administration. 15 (2009)	eng
dc.rights	Bez omezení	cze
dc.subject	digraph	eng
dc.subject	distance matrix	eng
dc.subject	distance polynomial	eng
dc.title	Some graph invariants related to the distance matrix of a digraph	eng
dc.type	Article	eng
dc.identifier.signature	47940-15
dc.peerreviewed	yes	eng
dc.publicationstatus	published	eng