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 8 of 8 for “"Graph domination"”.
-
Dominating sets in Kneser graphs
… 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 …
-
Heaps for error correction and the geometry of non-linear loop-transversal codes
… Loop-Transversal Codes in Error Correction and Graph Domination of Dagli et al. The goal is to establish a more general framework for error correcting codes and the loop-transversal code construction. We examine the specific example studied by Dagli et al. within this more general framework, …
-
Connected Domination in Graphs
… dominating set D is a set of vertices of a graph G = (V, E) such that every vertex in V − D is adjacent to at least one vertex in D and the subgraph hDi induced by the set D is connected. The connected domination number γc(G) is the minimum of the cardinalities of the connected dominating …
-
Characterizing Unmixed Trees with Respect to Total Domination and PMU Covers
… connections between commutative algebra and graph theory is the relationship between edge ideals and minimal vertex covers of a graph. Let $G=(V,E)$ be a simple graph with $V=\{x_1,\ldots,x_d\}$. The edge ideal of a graph is the ideal $I_G=(x_ix_j) \subsetneq k[x_1,\ldots,x_d]$ generated by …
-
Solving Hard Graph Problems with Combinatorial Computing and Optimization
Many problems arising in graph theory are difficult by nature, and finding solutions to large or complex instances of them often require the use of computers. As some such problems are $NP$-hard or lie even higher in the polynomial hierarchy, it is unlikely that efficient, exact algorithms will …
-
Degree Ramsey theory, game and Roman domination, and game saturation in graphs
"We examine several problems in extremal graph theory, emphasizing problems involving games on graphs. In Chapter 2, we study a variant of Ramsey theory, seeking Ramsey hosts with small maximum degree. We focus on finding such hosts for trees and cycles. In Chapter 3 we consider the ""on-line"" …
-
Paired and Total Domination on the Queen's Graph.
The Queen’s domination problem has a long and rich history. The problem can be simply stated as: What is the minimum number of queens that can be placed on a chessboard so that all squares are attacked or occupied by a queen? The problem has been expanded to include not only the standard 8x8 board, …