Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 2989 for “"domination"”.

  1. Weakly Connected Domination

    … 1 introduces the concept of weakly connected domination, a review of existing results and some relevant operations. Chapter 2 extends a known lower bound on the weakly connected domination number of trees to the more general class of cycle-disjoint graphs. Chapter 3 presents a characterisation …

    nus Repository record for Weakly Connected Domination (opens in a new tab) Download file for Weakly Connected Domination (opens in a new tab)

  2. Limited broadcast domination

    … broadcast is called the k-limited broadcast domination number of G, and is denoted by gamma_{b,k}(G). This parameter gamma_{b,k}(G) is a variation of the well-studied broadcast domination number. The value gamma_{b,k}(G) can also be defined as a solution to an integer linear programming …

    uvic Repository record for Limited broadcast domination (opens in a new tab)

  3. Eternal Domination Problems

    … This question is the basis for the eternal domination problem. In this thesis we investigate this problem and introduce new parameters related to it. These new parameters arise from changing three of the assumptions made when defining the game. Specifically we assume that any number of …

    uvic Repository record for Eternal Domination Problems (opens in a new tab)

  4. Algebraic finite domination

    This thesis focuses on proving a finite domination condition on bounded chain complexes of finitely generated free R-modules where R is a strongly Zn-graded ring.

    qu-belfast Repository record for Algebraic finite domination (opens in a new tab) Download PDF for Algebraic finite domination (opens in a new tab)

  5. Domination in Benzenoids

    … in $D$ or adjacent to a vertex in $D$. The domination number $\gamma=\gamma(G)$ of a graph $G$ is the size of a minimum dominating set. We will find formulas and bounds for the domination number of various special benzenoids, namely, linear chains $L(h)$, triangulenes $T_k$, and …

    vcu Repository record for Domination in Benzenoids (opens in a new tab)

  6. Domination in Graphs

    Vizing conjectured in 1963 that the domination number of the Cartesian product of two graphs is at least the product of their domination numbers; this remains one of the biggest open problems in the study of domination in graphs. Several partial results have been proven, but the conjecture has yet …

    usf Repository record for Domination in Graphs (opens in a new tab)

  7. On Pitman domination

    … itself. Special attention is given to Pitman domination for location-scale families. Finally, we construct Pitman-intransitive triples of estimators based on the earlier results on shrinkage and equivariant estimators.</p>

    iastate Repository record for On Pitman domination (opens in a new tab)

  8. Vertex-Criticality and Bicriticality for Independent Domination and Total Domination in Graphs

    … the parameter for the cases of independent domination and total domination. A graph is said to be independent domination vertex-critical, or i-critical, if the removal of any vertex decreases the independent domination number. Likewise, a graph is said to be total domination vertex-critical …

    uvic Repository record for Vertex-Criticality and Bicriticality for Independent Domination and Total Domination in Graphs (opens in a new tab)

  9. Alternative Medicine: Surviving Domination

    Interviews conducted among individuals who used alternative medicine in San Antonio, Texas, 1996 showed they were dissatisfied with Western medicine or wanted an option to biomedical treatments. Family and friends exerted the greatest influence on the types of alternative medicine respondents would …

    texas-state Repository record for Alternative Medicine: Surviving Domination (opens in a new tab)

  10. Independent domination critical graphs

    The domination number of a graph 𝘎 is the minimum size of any dominating set of 𝘎. The independent domination number of 𝘎 is the minimum size of any independent dominating set of 𝘎. We study several different definitions of graphs which are critical with respect to the domination number …

    uvic Repository record for Independent domination critical graphs (opens in a new tab)

  11. Connected Domination in Graphs

    … induced by the set D is connected. The connected domination number γc(G) is the minimum of the cardinalities of the connected dominating sets of G. The problem of finding a minimum connected dominating set D is known to be NP-hard. Many polynomial time algorithms that achieve some approximation …

    usf Repository record for Connected Domination in Graphs (opens in a new tab)

  12. Roman Domination Cover Rubbling

    In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of pebbles, so that from any initial …

    etsu Repository record for Roman Domination Cover Rubbling (opens in a new tab) Download PDF for Roman Domination Cover Rubbling (opens in a new tab)

  13. Global Domination Stable Graphs

    … of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications on the global domination number. In particular, we explore edge removal, edge addition, and vertex removal.

    etsu Repository record for Global Domination Stable Graphs (opens in a new tab) Download PDF for Global Domination Stable Graphs (opens in a new tab)

  14. Domination in Sparse Graphs

    … set that is the union of parts of pi. The pi-domination number gamma(G,pi) of G is the size of a smallest pi-dominating set. If each Vi in pi has size at most 2, we call pi a coupling of G and say that the vertices in Vi are coupled together. The coupled domination number, gamma cpl(G), is the …

    uiuc Repository record for Domination in Sparse Graphs (opens in a new tab)

  15. Power Domination on Permutation Graphs

    … they should be placed, is known as the power domination problem. We will consider this problem as it relates to permutation graphs on cycles, and suggest upper bounds for the power domination numbers on such graphs.

    texas-state Repository record for Power Domination on Permutation Graphs (opens in a new tab)

  16. Computational methods for domination problems

    … problem is currently known to exist. The queen domination problem is to find the minimum number of queens which, collectively, can attack every square on an n by n chess board. The related border queen problem is to find such a collection of queens with the added restriction that all queens lie …

    uvic Repository record for Computational methods for domination problems (opens in a new tab)

  17. Secure paired domination in graphs

    … the vertices of a graph - secure paired domination, where guards are required to be paired and, when a vertex is attacked, one or two guards move to defend the attacked vertex, while keeping the graph dominated and the guards paired after the move. We propose nine possible definitions of …

    uvic Repository record for Secure paired domination in graphs (opens in a new tab)

  18. Work, domination, and contemporary republicanism

    … and Quentin Skinner - has brought notions of domination and power to the forefront of political philosophy. Its proponents argue that non-domination is a radical ideal, one that is demanding and practical, and which can ground an effective and open-ended "normative and institutional research …

    oxford Repository record for Work, domination, and contemporary republicanism (opens in a new tab)

Page 1 of 150