UJDigispace Repository

Browsing Department of Mathematics (Pure and Applied Mathematics) (ETDs) by Subject "Combinatorial analysis."

Browsing Department of Mathematics (Pure and Applied Mathematics) (ETDs) by Subject "Combinatorial analysis."

Sort by: Order: Results:

  • Dorfling, Samantha (1998)
    Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at least one vertex in D. Then D is called a dominating set of G and the smallest cardinality of such a dominating set of G is ...

Search UJDigispace


Browse

My Account