The Gateway to Computer Science Excellence
+2 votes

Let $G=(V, E)$ be an undirected simple graph, and $s$ be a designated vertex in $G.$  For each $v\in V,$ let $d(v)$ be the length of a shortest path between $s$ and $v.$ For an edge $(u,v)$ in $G,$ what can not be the value of $d(u)-d(v)?$

  1. $2$
  2. $-1$
  3. $0$
  4. $1$
in Graph Theory by Boss (17.5k points)
recategorized by | 48 views

2 Answers

0 votes

Here $d(u)=2$  and $d(v) = 1$ so $d(u) - d(v) = 2-1 =1 $ so option $B$ eliminated.

here $d(u) = d(v) = 1 $ so $d(u) - d(v) = 0 $ so option $C$ eliminated.

Here $d(u)=1$  and $d(v) = 2$ so $d(u) - d(v) = 1-2 =-1 $ so option $D$ eliminated.


If you look at the above graphs then you would realize that we are just either calculating the shortest path of $s$ from either vertex $v$ or $u$(whichever is the shortest) and then just adding $1$ since both $u$ and $v$ are adjacent to each other so shortest path would increase by just $1$ edge distance.

Hence the difference between $d(u) - d(v)$ can never be greater than $1$.

So Option $A$ is the correct answer.

by Boss (23.7k points)
0 votes
max difference between d(u) and d(v) is 1. Bcz if d(u) not equal to d(v), then d(u)=d(v)+1( for edge u-v). As this is undirected graph, we do not need to think about direction. hence option A is the correct answer.
by (11 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
104,684 users