count incremented paths by addition of an edge

by user49739   Last Updated July 12, 2019 07:20 AM

I have a question related to the graph theory. I want to count the number of paths gets increased between nodes p and q by addition of an edge between p and q that makes the graph complete. For example, let us say there are x number of paths between p and q without the edge between p and q. Note that the graph becomes complete graph if we keep the edge between p and q. Now if we keep the edge between p and q(that means the graph becomes complete), let the number of paths between p and q are y. Now I want to compute y-x. Any suggestions for computing y-x.

Tags : graph-theory


Related Questions


Updated August 12, 2018 18:20 PM

Updated July 18, 2015 13:08 PM

Updated May 26, 2019 17:20 PM

Updated April 18, 2018 10:20 AM