# number of totally different path between two nodes in graph theory

I have an undirected, unweighted graph representing a network. I have a starting node and an end one. My 'network' is reliable if there is no node such that without that node s and t are not reachable i.e. no node is necessary and all nodes have at least one redundant path.

how can I formally verify this? thank you

-
What do you mean by "formally verify"? What do you mean that "all nodes have at least one redundant path"? –  Igor Rivin Sep 9 '12 at 18:22
As stated by Igor, you want biconnectivity. A naive way to check this is to check, for each vertex $v$, that $G-v$ is connected. –  Andrew D. King Sep 10 '12 at 20:25