2-Packing of a graph

Материал из WikiGrapp
Перейти к:навигация, поиск

2-Packing of a graph --- 2-упаковка графа.

A subset A of G is called a 2-packing of G if the closed neighborhoods of any two distinct vertices of A are disjoint. The 2-packing number of G is the maximum cardinality, \rho(G), of 2-packing of G.