Some graph invariants related to the distance matrix of a digraph
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25410%2F09%3A00009212" target="_blank" >RIV/00216275:25410/09:00009212 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Some graph invariants related to the distance matrix of a digraph
Original language description
It is the very usual case that the shortest paths between all pairs of vertices in a given graph are required. Then the distance matrix has to be arranged. In addition some quantities related to the distance matrix can be useful. The program in the system Mathemica was created to calculate spesific quantities for a given directed grph. Further the determinant of the distance matrixand the distance polynomial for a cycle were found.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Scientific Papers of the University of Pardubice, Series D
ISSN
1211-555X
e-ISSN
—
Volume of the periodical
14
Issue of the periodical within the volume
15
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
8
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—