1)determine |v|,given that G=(v,e) is regular graph with 12 edges?2)let G=(V,E) be a connected graph.What is the largest possible value of|V| if |E|=16 and deg(v)>=5 for all v belonging V?

Printable View

- Dec 28th 2012, 10:24 PMpanelopy123graph theory
1)determine |v|,given that G=(v,e) is regular graph with 12 edges?2)let G=(V,E) be a connected graph.What is the largest possible value of|V| if |E|=16 and deg(v)>=5 for all v belonging V?

- Dec 29th 2012, 07:21 AMPlatoRe: graph theory

You failed to say if these questions are about*simple graphs*or not.

Lets assume they are. You should know that .

Then what is a*regular graph*? If you know that the answer to the first is immediate.

The complete graph has each vertex of degree five.

However, and . If these are not simple graphs then we can add an edge, - Dec 29th 2012, 08:10 PMpanelopy123Re: graph theory
its a simple graph.