My Math Forum

My Math Forum (
-   New Users (
-   -   Path between 2 graphs (

mastriani July 3rd, 2018 06:02 PM

Path between 2 graphs
I have 2 un-direct graphs, A and B. I know that the intersection between A and B is not empty. In detail, suppose that s and d are nodes in A and that b is a node in B. I know that some nodes in I(b) (neighbors of b) and also their edges belong to A, but NOT b. Because I am looking for a path from s to d passing through b, I wish to prove that is plausible to insert the b node and its “restricted” set of edges ( E(I(b) in A) to the path. Any hint? Suggestion?

All times are GMT -8. The time now is 02:39 AM.

Copyright © 2019 My Math Forum. All rights reserved.