answersLogoWhite

0

A Compound Graph is an extension of a standard graph.

Let G be a graph, G=(V,E) where V is a set of vertices and E is a set of edges, that is e = (v1, v2) in V2

A compound graph C is defined by a tree T=(V,F) where V is the same set as G and F are tree edges f=(v1,v2) in V2. C=(G,T) where G=(V,E) and T=(V,F)

Furthermore, C has two additional constraints:

e=(v1,v2) in E implies:

1) v1 is not on the path of v2 to the root of T AND

2) v2 is not on the path of v1 to the root of T.

Intuitively, T defines a hierarchy. All the vertices sharing the same parent in T are in the same "group". The constraints state that you cannot have an edge connecting a vertex to one of its parent in the hierarchy.

User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor

Add your answer:

Earn +20 pts
Q: What is a compound graph?
Write your answer...
Submit
Still have questions?
magnify glass
imp