Add to ORKGAbstract: 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
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
It is the very usual case that the sbortest paths between all pairs of vertices in a given graph are...
The distance matrix, which is a structure less common than the adjacency matrix [ l] , has been incr...
AbstractLet M(n) be a graph which is obtained from a path Pn or a cycle Cn by replacing each vertex ...
AbstractLet G be a finite connected graph. If x and y are vertices of G, one may define a distance f...
AbstractDenote by G=(V,∼) a graph which V is the vertex set and ∼ is an adjacency relation on a subs...
We consider distance matrices of certain graphs and of points chosen in a rectangular grid. Formulae...
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed grap...
Distance matrices of graphs, particularly trees, have been investigated to a great extent in the lit...
Let G be a strongly connected, weighted directed graph. We define a product distance eta(i, j) for p...
In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the ch...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on t...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
It is the very usual case that the sbortest paths between all pairs of vertices in a given graph are...
The distance matrix, which is a structure less common than the adjacency matrix [ l] , has been incr...
AbstractLet M(n) be a graph which is obtained from a path Pn or a cycle Cn by replacing each vertex ...
AbstractLet G be a finite connected graph. If x and y are vertices of G, one may define a distance f...
AbstractDenote by G=(V,∼) a graph which V is the vertex set and ∼ is an adjacency relation on a subs...
We consider distance matrices of certain graphs and of points chosen in a rectangular grid. Formulae...
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed grap...
Distance matrices of graphs, particularly trees, have been investigated to a great extent in the lit...
Let G be a strongly connected, weighted directed graph. We define a product distance eta(i, j) for p...
In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the ch...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on t...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...