Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

In graph theory which one of these two will be called a weighted graph ?

  1. A graph where vertices have some weights or vales .
  2. A graph where edges have some weights or values .
  3. A graph where both edges and vertices have some weights or values
  4. A graph where neither edges nor vertices have any weights or values

I couldn't find a picture for the third case actually .

enter image description here

share|improve this question
    
Note: The figure does not give examples of weighted graphs. These are labels and not weights. Labels may not be repeated, whereas weights may be. –  Douglas S. Stones Mar 26 '13 at 13:43

4 Answers 4

up vote 6 down vote accepted

There is some variation in the literature, but typically a weighted graph refers to an edge-weighted graph, that is a graph where edges have weights or values. Without the qualification of weighted, the graph is typically assumed to be unweighted.

share|improve this answer

Answer choice (2) according to one popular text:

With each edge $e$ of $G$ let there be associated a real number $w(e)$, called its weight. Then $G$, together with these weights on its edges, is called a weighted graph.$^1$

[1] Bondy and Murty. Graph Theory with Applications. North-Holland, 1976 (page 15-16)

share|improve this answer

Weighted graph is a graph in which real number is associated with each edge of graph..

share|improve this answer

A weighted graph is also directed graph with weight on the edge of each graph

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.