Show that a graph with at least 2k vertices is k-connected if and
only if for...
Show that a graph with at least 2k vertices is k-connected if and
only if for any two unrelated subsets X, Y of V, such that | X | =
k = | Y |, there are k foreign paths between X and Y.
Solutions
Expert Solution
since, a graph is k connected if and only if it has k disjoint
paths joining two arbitrary vedrtex sets say X and Y of size k each
of many to many typeof which a vertex belongs to both the sets is
valid as one vertex path.
Let k be an integer satisfying k ≥ 2. Let G be a connected graph
with no cycles and k vertices. Prove that G has at least 2 vertices
of degree equal to 1.
let
G be a simple graph. show that the relation R on the set of
vertices of G such that URV if and only if there is an edge
associated with (u,v) is a symmetric irreflexive relation on
G