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 24 for “"Graph Decompositions"”.
-
Generalizing graph decompositions
… There is a vast literature on how to do this on graphs. But often we need to compute on other structures (decorated graphs or perhaps algebraic objects such as groups) for which we do not have a wealth of decomposition methods. This thesis attacks this problem head on: we propose new …
-
Cyclic automorphic graph decompositions
… for this report. Basic definitions and topics of graph theory which pertain to the report and discussion of automorphic decompositions will be covered in brief detail. An automorphic decomposition D of a graph H by a graph G is a G-decomposition of H such that the intersection of graph (D) @H. H …
-
Localized structure in graph decompositions
Let v ∈ Z+ and G be a simple graph. A G-decomposition of Kv is a collection F={F1,F2,...,Ft} of subgraphs of Kv such that every edge of Kv occurs in exactlyone of the subgraphs and every graph Fi ∈ F is isomorphic to G. A G-decomposition of Kv is called balanced if each vertex of Kv occurs in the …
-
Asymptotic existence results on specific graph decompositions
… asymptotic edge-decomposition problems on graphs. A G-group divisible design (G-GDD) of type [g_1, ..., g_u] and index lambda is a decomposition of the edges of the complete lambda-fold multipartite graph H, with groups (maximal independent sets) G_1, ..., G_n, |G_i| = g_i, into graphs …
-
The asymptotic existence of graph decompositions with loops
… than or equal to] 0 be integers and G be a graph with n vertices, m edges, and no multiple edges. A (v, k, lambda) block design is a collection Beta of k-subsets of a v-set X in which every unordered pair of elements in X is contained in exactly lambda of the subsets in Beta. A …
-
Accelerated Least Squares Network Adjustments and Graph Decompositions
… In the second phase of this project, we review graph decompositions and find a cut decomposition which nearly meets the requirement of the Helmert Blocking method. We elaborate on the cut decomposition to create a block decomposition which is more suitable for the Helmert Blocking method. We …
-
Graph decompositions and variance balanced block designs of experiments
… When the errors are correlated, we introduce graph theory to study construction methods of VBDs. We develop new methods via graph decomposition. In addition, we construct block designs such that the covariance matrix of the least squares estimator of treatment effects is completely symmetric. …
-
Putting the pieces together: from graph decompositions to Ramsey theory
This thesis investigates the decomposition of graphs into a small number of well-structured subgraphs and the unavoidable substructures that arise in such decompositions. <br><br>A celebrated problem in this area is the Linear Arboricity Conjecture, which states that the edges of every graph with …
-
On graph decompositions: Exploring the stars and stripes problem with odd n-stars
… the “Stars and Stripes" problem, which is a graph decomposition problem. The Stars and Stripes problem can be described as finding uniformly resolvable decompositions when the blocks are either $n$-stars or edges. In other words, this refers to decomposing a complete graph into spanning …
-
ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16
This dissertation tackles the challenging graph decomposition problem of finding solutions to the uniform case of the Hamilton-Waterloo Problem (HWP). The HWP seeks decompositions of complete graphs into cycles of specific lengths. Here, we focus on cases with a single factor of 6-cycles. The …
-
Minimal PMU placement for graph observability: a decomposition approach
… Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement algorithms are developed for graphs of bounded tree width, such as trees and outer planar graphs. Graph …
-
Linear methods for rational triangle decompositions
Given a graph G, a K_3-decomposition of G, also called a triangle decomposition, is a set of subgraphs isomorphic to K_3 whose edges partition the edge set of G. Further, a rational K_3-decomposition of G is a non-negative rational weighting of the copies of K_3 in G such that the total weight on …
-
Planning and Execution for Discrete Integration
… a surge in high-level reasoning tools based on graph decompositions, spurred by several competitions. While some existing discrete integration tools (counters) tightly integrate with these low-level computational or high-level reasoning tools, no existing counter is able to leverage both …
-
On the independent spanning tree conjectures and related problems
… (edge-)disjoint. The relationship between graph (edge-)connectivity and the existence of (edge-)independent spanning trees is explored. The (Edge-)Independent Spanning Tree Conjecture states that every k-(edge-)connected graph has k-(edge-)independent spanning trees with arbitrary root. We …
-
Some Results on Seymour’s Second-Neighborhood Conjecture and on Decompositions of Graphs
… states that every orientation of every simple graph has at least one vertex v such that the number of vertices of out-distance 2 from v is at least as large as the number of vertices of out-distance 1 from it. I present alternative statements of this conjecture using the language of linear …
-
Extremal Problems for Partitions of Edge Sets of Graphs
… thesis considers three families of problems in graph theory about partitions of the edge sets of graphs (also known as graph decompositions). The first family we address consists of induced Ramsey number problems. Induced Ramsey numbers generalize ordinary Ramsey numbers. The induced Ramsey …
-
Sarvate-beam group divisible designs and related multigraph decomposition problems
… remain. A relationship between these designs and graph decompositions is developed and leads to some generalizations. The use of matrices and linear programming is also explored and give rise to related results.
-
Branch decompositions and their applications
… modeled as optimization or decision problems on graphs. Also, many of those real-life problems are NP-hard. One traditional method to solve these problems is by branch and bound while another method is by graph decompositions. In the 1980's, Robertson and Seymour conceived of two new ways to …
-
Product Structure, Separating Systems, Freeze-Tag Problem, and Planar Multicolor Turan Number
… is based on a collection of papers focused on graph theory and computational geometry. The first paper focuses on the Product Structure Theorem for planar graphs, which asserts that any planar graph can be embedded in the strong product of a planar 3-tree, a path, and a 3-cycle. The paper …
-
Critical Cliques and Their Application to Influence Maximization in Online Social Networks
Graph decompositions have useful applications in optimization problems that are categorized as NP-Hard. Modular Decomposition of a graph is a technique to decompose the graph into non-overlapping modules. A module M of an undirected graph G = (V, E) is commonly defined as a set of vertices such …
Page 1 of 2