I need the proof of the folowing Theorem:
If X is the adjacency matrix of a graph G with n vertices, and , then G is disconnected if and only if there exist at least one entry in matrix Y that is zero.
Follow Math Help Forum on Facebook and Google+
What ideas have you had so far?
View Tag Cloud