Is the statement ""For every natural number n ≥ 1 there exists a directed graph of n vertices for which every vertex has an indegree equal to its outdegree"" TRUE or FALSE?

The given statement is false.

Step-by-step explanation:

Reason

let D be a directed graph with 'n' no of vertices and 'E' edges.

where 'n'=1.  thus D =(n,E).

In degree: in directed graph the number of incoming edges on a vertex is known as indegree.

it is denoted as deg ⁺(n).

And now we know that in a directed graph

if deg ⁻(n)= deg ⁺(n) for each vertex n.

fa tha first one you gonna add y to both sides

it look like this

x-y+y=6+y

x=y+6

therefore your answer is

x =y+6

fa tha second one

you gonna flip tha equation

it gonna look like x-4y=y

then add 4 to both sides

it gonna look like tha

x-4 +4 =y +4

so therefore tha answer is x=y+4

step-by-step explanation:

-2

7 - 9 = -2

reversed:

-2 + 9 = 7