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 46 for “"Dominating sets"”.
-
Dominating sets in Kneser graphs
This thesis investigates dominating sets in Kneser graphs as well as a selection of other topics related to graph domination. Dominating sets in Kneser graphs, especially those of minimum size, often correspond to interesting combinatorial incidence structures. We begin with background on the …
-
Vertices in Total Dominating Sets.
… let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is …
-
Information Retrieval and Dominating Sets
… bits. Damaschke has shown that finding lcube dominating sets in hypercubes is equivalent to finding schemes for membership testing. The specific schemes that he found only serve as proof-of-concept and the problem of optimal schemes is an open question. Our main contribution is numerical …
-
Mixed-Weight Open Locating-Dominating Sets
… that solves this problem is the open locating-dominating set (OLD-set), a set of nodes that forms a unique and nonempty neighborhood with every node in the graph. For this work, we begin with a study of OLD-sets in circulant graphs. Circulant graphs are a group of regular cyclic graphs that are …
-
Optimization Approaches for Open-Locating Dominating Sets
An Open Locating-Dominating Set (OLD set) is a subset of vertices in a graph such that every vertex in the graph has a neighbor in the OLD set and every vertex has a unique set of neighbors in the OLD set. This can also represent where sensors, capable of detecting an event occurrence at an …
-
Trees with Unique Minimum Locating-Dominating Sets.
… of vertices in a graph G = (V, E) is a locating-dominating set if S is a dominating set of G, and every pair of distinct vertices {u, v} in V - S is located with respect to S, that is, if the set of neighbors of u that are in S is not equal to the set of neighbors of v that are in S. We give a …
-
Locating and Total Dominating Sets in Trees.
A set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct …
-
A New Optimality Measure for Distance Dominating Sets
… of an input graph that has <em>k</em> disjoint dominating sets, where the <em>i</em>th power of an input graph <em>G</em> is constructed by adding edges between pairs of vertices in <em>G</em> at distance <em>i</em> or less, and a subset of vertices in a graph <em>G</em> is a dominating set if …
-
Sphere-cut decompositions and dominating sets in planar graphs
Ένα σημαντικό αποτέλεσμα στη Θεωρία Γραφημάτων αποτελεί η απόδειξη της εικασίας του Wagner απο τους Neil Robertson και Paul. D. Seymour στη σειρά εργασιών "Ελλάσονα Γραφήματα" απο το 1983 εώς το 2011. Η εικασία αυτή λέει ότι στην κλάση των γραφημάτων δεν υπάρχει άπειρη αντιαλυσίδα ως προς τη σχέση …
-
In solving the dominating set problem : group theory approach
This thesis presents a new way to find the dominating set of a graph by introducing the concept of an orbit graph and a weighted dominating set. We showed that the Blokhuis-Lam method for the football pool problem is a special case of assuming that the solution has a non-trivial automorphism group. …
-
Fort Neighborhoods: A Set Cover Formulation for Power Domination
… power domination numbers and minimum power dominating sets in graphs. Additionally, it shows how the existence of solutions of special forms can be exploited by computational methods. Power domination studies arise from a key problem in electrical engineering concerning placements of …
-
Total Domination Ratios of Archimedean Lattices
… to $D$ or are adjacent to an element of $D$. A dominating set of vertices is a total dominating set if every vertex is adjacent to an element of the set. A total dominating set of vertices is efficient if every vertex is adjacent to a unique element of the set. The total domination ratio is the …
-
Problems in Domination and Graph Products
… its parameters. We first consider unique minimum dominating sets in Cartesian product graphs. Our attention then turns to unique minimum independent dominating sets in trees, and in some direct product graphs. Next, we consider an extremal graph theory problem and determine the maximum number of …
-
Generating quality dominating set
Construction of a small size dominating set is a well known problem in graph theory and sensor networks. A Connected dominating set (CDS) can be used as a backbone structure in sensor networks for message delivery and broadcast. The general dominating set problem is known to be NP-hard and some …
-
Vertex-Criticality and Bicriticality for Independent Domination and Total Domination in Graphs
… the vertex set is the collection of minimum dominating sets of G. Adjacency between two minimum dominating sets in the gamma-graph occurs if from one minimum dominating set a vertex can be removed and replaced with a vertex to arrive at the other minimum dominating set. One can think of …
-
Backbones for military multilayer wireless ad hoc networks based on networks science concepts
… first we build on the (minimum) Connected node Dominating Sets theory and propose novel distributed algorithms to efficiently connect multilayer ad hoc networks so as to reduce their latency, improve their scalability and increase their lifetime.Then, we investigate the problem of distributed …
-
EFFICIENT AND PERFECT DOMINATION ON ARCHIMEDEAN LATTICES
… the set S or is adjacent to a vertex in set S. A dominating set is a perfect dominating set if every vertex not in the dominating set is dominated exactly once. The domination ratio is the minimum proportion of vertices in a dominating set. The perfect domination ratio is the minimum proportion of …
-
Διάχυση πληροφορίας και κυρίαρχα σύνολα σε ασύρματα δίκτυα αισθητήρων
… proposed method is based on the use of connected dominating sets. Connected Dominating Sets can ensure that all nodes in a network will either belong to them or they are at least a certain number of hops away from at least one node of them. This creates a backbone that facilitates the …
Page 1 of 3