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 655 for “"domination"”.
-
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.
-
Multiple domination in graphs
… generalizing the already much studied concept of domination in graphs. In particular, we are interested in finding k-dominating sets of minimum cardinality. Inspired by Fink and Jacobson, Cockayne, Gamble and Shepherd proved in the same year that the k- domination of every graph with minimum …
-
Global Domination Stable Graphs
… global dominating set of <i>G</i> is the global domination number of <i>G</i>. We explore the effects of graph modifications on the global domination number. In particular, we explore edge removal, edge addition, and vertex removal.</p>
-
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 …
-
Power Domination in graphs
Domination in graphs has been studied since the 1800s. Many parameters related to domination have been defined and studied since then. Power domi-nation was first defined and studied in the early 2000s. It is an abstraction of how an electrical power system is monitored. In this thesis, we focus on …
-
Independent Domination Of Subcubic Graphs
Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three. In this paper, we will show that the independent domination number of a connected subcubic graph of …
-
Double Domination of Complementary Prisms.
… every vertex of <em>G</em> twice. The <em>double domination number</em>, denoted γ<sub>×2</sub>(<em>G</em>), is the cardinality of a minimum double dominating set of <em>G</em>. We have proven results on graphs of small order, specific families and lower bounds on γ<sub>×2</sub>(GG̅).</p>
-
Locating-Domination in Complementary Prisms.
… where <em>v</em> ≠ <em>u</em>. The locating-domination number of <em>G</em> is the minimum cardinality of a locating-dominating set of <em>G</em>. In this thesis, we study the locating-domination number of complementary prisms. We determine the locating-domination number of <em>GG̅</em> for …
-
Independent Domination in Complementary Prisms.
… graph. In this paper we investigate independent domination in complementary prisms.</p>
-
Cost Effective Domination in Graphs
… set of <em>G</em> is the cost effective domination number of G. In addition to some preliminary results for general graphs, we give lower and upper bounds on the cost effective domination number of trees in terms of their domination number and characterize the trees that achieve the upper …
-
Liar's Domination in Grid Graphs
<p>As introduced by Slater in 2008, liar's domination provides a way of modeling protection devices where one may be faulty. Assume each vertex of a graph <em>G</em> is the possible location for an intruder such as a thief. A protection device at a vertex <em>v</em> is assumed to be able to detect …
-
Paired-Domination in Grid Graphs.
… the subgraph induced by <em>S</em>. The domination number of a graph <em>G</em> is the smallest cardinality of any dominating set of <em>G</em>, and the paired-domination number is the smallest cardinality of any paired-dominating set. Determining the domination number for grid graphs is …
-
Domination in graphs: Vizing's conjecture
… remains one of the biggest open problems in domination in graph theory today. The conjecture states that the domination number of the Cartesian product of two graphs is at least as large as the product of the domination numbers of the two factor graphs. The aim of this thesis is to study the …
-
Domination parameters and their unique realizations
This thesis deals with domination parameters in graphs and in particular with their unique realization. Domination parameters measure the minimal or maximal cardinality of special subsets of the vertex set (or the edge set) of a graph. Concepts of domination considered in this thesis are …
-
Using Domination to Analyze RNA Structures.
… secondary RNA structures. In this thesis we use domination parameters to predict which trees are more likely to exist in nature as RNA structures. This approach appears to have promise in graph theory applications in genomics research.</p>
-
Bounds on Total Domination Subdivision Numbers.
<p>The domination subdivision number of a graph is the minimum number of edges that must be subdivided in order to increase the domination number of the graph. Likewise, the total domination subdivision number is the minimum number of edges that must be subdivided in order to increase the total …
-
Variations of zero forcing and power domination
… the system. This process is known as the power domination process, and it is a well researched area of graph theory. Power domination has since been generalized using different variations of zero forcing. The generalization that will be discussed in this dissertation is known as $k$-power …
-
On Topological Indices And Domination Numbers Of Graphs
… stability of chemical compounds. The concepts of domination number and independent domination number, introduced from the mid-1860s, are very fundamental in Graph Theory. In this dissertation, we provide new theoretical results on these two topics. We study k-trees and cactus graphs with the sharp …
Page 1 of 33