minimal number of edges for a graph of size N so that there are two paths between any pair of nodes

38 Views Asked by At

I am trying to figure out how many edges are nessisary in a graph of size n so that between any two nodes in the graphs, there are two path that differ by at least one edges connecting them. (I allow for multiple independent edges between two nodes)