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 69 for “"Domination number"”.
-
The 2-Domination Number of a Caterpillar
… in V − D has at least two neighbors in D. The 2-domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a 2- dominating set of G. In this thesis, we discuss the 2-domination number of a special family of trees, called caterpillars. A caterpillar is a graph denoted by …
-
On the domination number of a digraph
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1994
-
On the Bounds of the Domination Number of Permutation Graphs
No abstract prepared.
-
Domination in Graphs and the Removal of a Matching
We consider how the domination number of an undirected graph changes on the removal of a maximal matching. It is straightforward that there are graphs where no matching removal increases the domination number, and where some matching removal doubles the domination number. We show that in a …
-
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 …
-
Total Domination Dot Critical and Dot Stable Graphs.
… union of their neighborhoods. A graph is total domination dot-critical if identifying any pair of adjacent vertices decreases the total domination number. On the other hand, a graph is total domination dot-stable if identifying any pair of adjacent vertices leaves the total domination number …
-
Restrained and Other Domination Parameters in Complementary Prisms.
In this thesis, we will study several domination parameters of a family of graphs known as complementary prisms. We will first present the basic terminology and definitions necessary to understand the topic. Then, we will examine the known results addressing the domination number and the total …
-
Paired-Domination in Grid Graphs.
… matching in 〈S〉, the subgraph induced by S. The domination number of a graph G is the smallest cardinality of any dominating set of G, and the paired-domination number is the smallest cardinality of any paired-dominating set. Determining the domination number for grid graphs is a well-known open …
-
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 …
-
Cost Effective Domination in Graphs
… dominating set of G 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 …
-
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 …
-
Very Cost Effective Domination in Graphs
… cardinality of a dominating set of G is the domination number of G. A vertex v in a dominating set S is said to be very cost effective if it is adjacent to more vertices in V\S than to vertices in S. A dominating set S is very cost effective if every vertex in S is very cost effective. The …
-
Double Domination Edge Critical Graphs.
… of a double dominating set of G is the double domination number. A graph G is double domination edge critical if for any edge uv ∈ E(G̅), the double domination number of G+uv is less than the double domination number of G. We investigate properties of double domination edge critical graphs. In …
-
Roman Domination in Complementary Prisms
… is adjacent to a vertex with label 2. The Roman domination number γR(G) of G is the minimum f(V ) = Σv∈V f(v) over all such functions of G. We study the Roman domination number of complementary prisms. Our main results show that γR(GG) takes on a limited number of values in terms of the …
-
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.
-
Topics In Probabilistic Combinatorics
… the paper. Chapter 2 introduces the independent domination number. It is then shown that in the random graph model G(n,p) with probability tending to one, the independent domination number is one of two values. Also, the the number of independent dominating sets of given cardinality is analyzed …
-
Locating-Domination in Complementary Prisms.
… for all v ∈ V (G)D where v ≠ u. The locating-domination number of G is the minimum cardinality of a locating-dominating set of G. In this thesis, we study the locating-domination number of complementary prisms. We determine the locating-domination number of GG̅ for specific graphs and …
-
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 …
Page 1 of 4