Some graph invariants related to the distance matrix of a digraph

Kód výsledku v 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>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Some graph invariants related to the distance matrix of a digraph
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Some graph invariants related to the distance matrix of a digraph
Popis výsledku anglicky
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.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
BA - Obecná matematika
OECD FORD obor
—

Rok uplatnění
2009
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)