Consider a weighted undirected graph with positive edge weights and let $$uv$$ be an edge in the graph. It is known that the shortest path from the source vertex $$s$$ to $$u$$ has weight 53 and the shortest path from $$s$$ to $$v$$ has weighted 65. Which one of the following statements is always true?

Let $$G$$ be the non-planar graph with minimum possible number of edges. Then $$G$$ has

Consider the set of (column) vectors defined by $$X = \,\{ \,x\, \in \,{R^3}\,\left| {{x_1}\, + \,{x_2}\, + \,{x_3} = 0} \right.$$, where $${x^T} = \,{[{x_1}\, + \,{x_2}\, + \,{x_3}]^T}\} .$$ Which of the following is TRUE?

A partial order P is defined on the set of natural numbers as following. Herw x/y denotes integer division.
i) (0, 0) $$ \in \,P$$.
ii) (a, b) $$ \in \,P$$ if and only a %
$$10\, \le $$ b % 10 and
)a/10, b/10) $$ \in \,P$$.

Consider the following ordered pairs:
$$\matrix{ {i)\,\,\,(101,\,22)} & {ii)\,\,\,(22,\,\,101)} \cr {iii)\,\,\,(145,\,\,265)} & {iv)\,\,\,(0,\,153)} \cr } $$
Which of these ordered pairs of natural numbers are comtained in P?