Search
Now showing items 1-1 of 1
Die effek van veelvuldige lynverwydering op die onafhanklikheidsgetal van ’n asikliese grafiek
(AOSIS, 2018)
ENGLISH ABSTRACT: A subset X ⊆ V of the vertex set V of a graph G = (V,E) is an independent set in G if no two
vertices of V are adjacent in G. The cardinality of a largest independent set in G is called
the independence ...