k-edge-connectivity

63 Views Asked by At

For every positive integer $k$ construct an infinite family of graphs G with $\lambda(G)=k$ without using parallel edges in the construction. I can't construct infinite family of graphs that satisfies the given condition. hint is appreciated.

1

There are 1 best solutions below

3
On

Hint: For some $n>k$, draw two copies of $K_n$. Can you think of a way to add edges to that graph such that its edge-connectivity would be $k$?