Формально, для графа {\displaystyle G=(V,E)}G=(V,E) и {\displaystyle K={\mathcal {P}}(V^{2})}{\displaystyle K={\mathcal {P}}(V^{2})} — множества всех двухэлементных подмножеств его вершин, дополнение {\displaystyle G'}G' определяется как пара {\displaystyle (V,K\setminus E)}{\displaystyle (V,K\setminus E)} — граф, с исходным набором вершин, и с набором ребёр, полученным из полного графа удалением имевшихся в заданном графе.
Дополнение пустого графа является полным графом, и наоборот. Независимое множество графа является кликой в дополнении графа, и наоборот. Дополнение любого графа без треугольников не содержит клешней.
1. She found £10 beneath the sofa.
2. James filled to the police to report the incident.
3. He dived into the swimming pool twice.
4. He told me the truth.
5. I watched the last episode of my favourite TV series yesterday.
6. She sended him a present by post.
7. Mary crying a lot when she heard the bad news.
8. Brian went the train to London.
9. She felt happy when she got her jewels back.
10. Peter dropped my mother's antique vase. It broke into thousands of pieces.
11. Laura сalled her mother as soon as she arrived in Paris.
12. He stoped talking when I walked into the room.
13. She tryed to stop the thief, but he got away.
14. She took the glass with orange juice.
15. Miss Marple solved many mysteries in St Mary Mead.
GOOD LUCK
2*2*3*3*3*17=1836 1836\204=9