Graphical Learning Flashcards
1
Q
Define a Markov graph
A
If A,B,C subgraphs, then C separates A and B if every path if every path from A to B intersects the node C
2
Q
What is a clique?
A
A complete subgraph
3
Q
When is a clique maximal?
A
If it is a clique and no other vertices can be added, and still be a clique