I have a multigraph G whose edges have three identities. Let’s say I have three colors of the edges red, blue and green and each two nodes may be connected by a red, blue and/or green edges. The graph formed by the edges of one color is connected. My problem is that:
- I want to discover a minimal spanning tree for each graph formed by the edges of one color (that is 3 spanning trees) such that:
- these 3 spanning trees have a maximum number of common edges (edges connecting the same nodes in the 3 spanning trees)
I am trying to map this to an optimization problem. However I would like to know if there is a solution for such problem in graph theory.
Many thanks for your help!
