An independent set in a graph G is a set of vertices with no

An independent set in a graph G is a set of vertices with no edges between them. Let a(G) denote the size of the largest independent set in G, and recall that t(G) denotes the size of the smallest vertex cover in G. Prove that in any graph G on n vertices, a(G) + t(G) = n.

Solution

it includes yhe isolated vertices as well... its true..

https://fbcdn-sphotos-h-a.akamaihd.net/hphotos-ak-xpf1/v/t34.0-12/11004370_816252111763019_1874895682_n.jpg?oh=1120fccda0930916c9875aa0ccedf96d&oe=54ED76E6&__gda__=1424859382_eee3ca95b93882e6852dd7f1200b5ef9

https://fbcdn-sphotos-h-a.akamaihd.net/hphotos-ak-xpf1/v/t34.0-12/11007559_816252105096353_688706709_n.jpg?oh=dcf40ec22faa83a523e07f0042a9ebdc&oe=54ED4D44&__gda__=1424839385_54080e8b377e9e01730abe9fae7e9fdc