Study on the Domination and Related Subset Problems

    Project: Other project

    Project Details

    Description

    A set S⊆V(G) is a dominating set of G if N[S]=V(G), i.e. every vertex in
    V(G) is either in S or adjacent to a vertex in S. The domination number γ(G)
    is the minimum cardinality of a dominating set of G. Using modern techniques and methods of domination theory, algebraic number theory, probability theory and combinatorics, the domination and related subset problems will be researched. This research will enrich the domination theory of graphs. Furthermore some theories in related areas such as linear algebra optimization, design and analysis of communication networks, social sciences, computational complexity and algorithm design will also be developed.
    StatusFinished
    Effective start/end date01/09/0731/08/08