This video explains clique graphs, an operation from graph theory that outputs a graph relating the maximal cliques of the input graph. The clique graph of an undirected graph G, is itself a graph with one vertex for each maximal clique in G, and in which two vertices are adjacent when their corresponding maximal cliques in G share at least one vertex. In this video you'll see examples of clique graphs, and you'll also learn some of the properties of clique graphs. One of my favorite properties is the last one covered in the video, which we'll have to prove in a future video. It's about what happens when you iterate the clique graph operation.

Here are some links for more information:
[ Ссылка ]
[ Ссылка ]
[ Ссылка ]
[ Ссылка ]

Recommended Books:
******************************** Hypergraph Theory ********************************
"Hypergraph Theory: An Introduction": [ Ссылка ]

******************************** Graph Theory ********************************
"Introduction to Graph Theory (Trudeau)": [ Ссылка ]

"Graph Theory (Diestel)": [ Ссылка ]

******************************** Misc. Undergraduate Mathematics ********************************
Discrete Mathematics with Applications (Epp): [ Ссылка ]

A Book of Abstract Algebra (Pinter): [ Ссылка ]

Language, Proof and Logic: [ Ссылка ]

Linear Algebra and Its Applications: [ Ссылка ]

All the Math You Missed: [ Ссылка ]

These are my Amazon Affiliate links. As an Amazon Associate I may earn commissions for purchases made through the links above.

0:00 Preliminaries
1:00 Definition
5:40 Properties
7:30 Iterated Clique Graphs

свернуть