On heavy paths in 2-connected weighted graphs

Details On heavy paths in 2-connected weighted graphs On heavy paths in 2-connected weighted graphs

2011-11-24

arxiv.org/abs/1111.5756v1

Mathematics

Combinatorics

Scientific paper

A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the edges incident with it. In this paper we give three weighted degree conditions for the existence of heavy or Hamilton paths with one or two given end-vertices in 2-connected weighted graphs.

Affiliated with

Also associated with

No associations

Rating

On heavy paths in 2-connected weighted graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On heavy paths in 2-connected weighted graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On heavy paths in 2-connected weighted graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157261