I have a fuzzy graph
G=(V, E) where
V is the set of vertices and
E is the set of edges. Every vertex is a fuzzy vertex, that means, it has a property with a membership function associated to it (stored in the vertex somehow). Every edge is a fuzzy edge, that means, it has a property with a membership function associated to it (stored in the edge somehow). By doing this,
G is a fuzzy graph in terms of edges and vertices.
G2, another fuzzy graph with different (or equal) number of edges and/or vertices, I need to compare both graphs in a fuzzy way. I want to check if
G2 is a subgraph or
G (or vice versa). Is there any algorithm to address this?