Some graph invariants related to the distance matrix of a graph
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18440%2F09%3A00002774" target="_blank" >RIV/62690094:18440/09:00002774 - 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 graph
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
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, Faculty of economics and administration
ISSN
1211-555X
e-ISSN
—
Volume of the periodical
15
Issue of the periodical within the volume
1
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
9
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—