Abstract
Given a positive-weighted simple connected graph with vertices, labelled by the numbers , we can construct an matrix whose entry , for any , is the minimal weight of a path between and , where the weight of a path is the sum of the weights of its edges. Such a matrix is called the distance matrix of the weighted graph. There is wide literature about distance matrices of weighted graphs. In this paper we characterize distance matrices of positive-weighted -hypercube graphs. Moreover we show that a connected bipartite -regular graph with order is not necessarily the -hypercube graph. Finally we give a characterization of distance matrices of positive-weighted Petersen graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.