A characterization of distance matrices of weighted cubic graphs and Peterson graphs

preprint2020arXivOpen access

Abstract

Given a positive-weighted simple connected graph with mm vertices, labelled by the numbers 1,…,m1,\ldots,m, we can construct an m×mm \times m matrix whose entry (i,j)(i,j), for any i,j∈{1,…,m}i,j\in\{1,\dots,m\}, is the minimal weight of a path between ii and jj, 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 nn-hypercube graphs. Moreover we show that a connected bipartite nn-regular graph with order 2n2^n is not necessarily the nn-hypercube graph. Finally we give a characterization of distance matrices of positive-weighted Petersen graphs.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.