For integers 1<=a<=b<=c, construct a graph G with k(G)=a, lamda(G)=b and delta(G)=c.

ferdysy9

ferdysy9

Answered question

2022-08-08

For integers 1<=a<=b<=c, construct a graph G with k(G)=a, lamda(G)=b and delta(G)=c.

Answer & Explanation

Emely English

Emely English

Beginner2022-08-09Added 16 answers

The minimum value of a, b or call can be 1.
k(G)=a(>=1). Thus the graph is complete.
Delta(G) =c(>=1) this mean that a vertex can have at maximum of atleast 1 connection but this is not possible. Also lambda(G) =b(>=1).this means that a vertex is connected by already one other vertex.
Thus we can see that in the graph G, the minimum number of connection is atleast 1 and maximum is atleast 2.
Also,k(G)=a=n-2
Thus,1<=n-2
Or,n>= 3

Do you have a similar question?

Recalculate according to your conditions!

New Questions in Elementary geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?