My Math Forum  

Go Back   My Math Forum > Welcome > New Users

New Users Post up here and introduce yourself!

LinkBack Thread Tools Display Modes
July 3rd, 2018, 06:02 PM   #1
Joined: Jul 2018
From: Harbin

Posts: 1
Thanks: 0

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?
mastriani is offline  

  My Math Forum > Welcome > New Users

graphs, path

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Path of Projectile waz Calculus 4 May 28th, 2015 06:07 AM
Question on isomorph Graphs and their complement Graphs MageKnight Applied Math 0 January 17th, 2013 10:38 PM
path dependent function with a definite path aise5668 Real Analysis 3 March 5th, 2012 06:36 PM
path-connected TTB3 Real Analysis 1 December 11th, 2009 02:55 PM

Copyright © 2019 My Math Forum. All rights reserved.