A tree has 7 vertices.   (i)  How many edges this tree can have?    (ii) If the degrees of first six vertices are  1,1,1,2,2 and 3 then what is the degree of         next vertex? Show all your work.    (iii) If the degrees of vertices are 1,1,2,2,3,3 and 4 then is it possible to have such           tree? Explain with detail

I need help with those questions; thank you. 1, A simple digraph with 4 vertices with in-degrees 0, 1, 2, 2 and out-degrees 0, 1, 1, 3. Is it possible or impossible? Show an example or explain why it’s impossible 2, A simple digraph with 5 vertices with in-degrees 0, 1, 2, 4, 5 and out-degrees 0, 3, 3, 3, 3. Is it possible or impossible? Show an example or explain why it’s impossible.

Discrete Math

Please help me with these questions. I am having trouble understanding what to do Thank you

1. What is the largest n such that P₁, is a subgraph of K? 2. What is the largest n such that C₁ is a subgraph of K? 3. What is the largest n such that P₁ is an induced subgraph of K₁² 4. What is the largest n such that C₁ is an induced subgraph of K6?

Stuck need help! The class I'm taking is computer science discrete structures.  Problem is attached. please view attachment before answering.  Really struggling with this concept. Thank you so much.

Construct a simple graph that is a forest with vertices O, P, Q, R, S, T, U, V such that the degree of U is 2 and there are 3 components. What is the edge set? You have attempted this problem ti

Discrete Math

Discrete Math