Some graph invariants related to the distance matrix of a digraph

Seibert, Jaroslav; Skálová, Magdalena; Trojovský, Pavel

Digitální knihovna UPCE
→
Univerzita Pardubice
→
Publikace vydané Univerzitou Pardubice / Published by the University of Pardubice
→
Odborné časopisy / Journals
→
Scientific papers of the University of Pardubice
→
Series D, Faculty of Economics and Administration
→
2009/15 Scientific papers, Series D
→
Zobrazit záznam

Some graph invariants related to the distance matrix of a digraph

Seibert, Jaroslav; Skálová, Magdalena; Trojovský, Pavel

Soubory tohoto záznamu

URI: http://hdl.handle.net/10195/35697

Datum publikování: 2009

Typ dokumentu: Article

Zdrojový dokument: Scientific papers of the University of Pardubice. Series D, Faculty of Economics and Administration. 15 (2009)

ISSN: 1211-555X

Abstrakt:

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.

Zobrazit celý záznam