A weighted graph is a graph in which each edge is assigned a non-negative number, called the weight. The weight of a path (cycle) is the sum of the weights of its edges. The weighted degree of a vertex is the sum of the weights of the edges incident with the vertex. A usual (unweighted) graph can be considered as a weighted graph with constant weight 1. In this paper, it is proved that for a 2-connected...
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.