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 6 of 6 for “"covering graphs"”.
-
Covering Graphs and Equiangular Tight Frames
… between equiangular tight frames and covering graphs of complete graphs. In this thesis, we will explain equiangular tight frames and covering graphs of complete graphs and present the results that show the relationship between these two concepts. The latest results about the …
-
Perfect matchings: Modified Aztec diamonds, covering graphs andn-matchings
… of perfect matchings for each of the modified graphs and the placement probabilities of the edges belonging to such a matching at a given location. We conclude with a theorem presenting the common asymptotic behaviour of the dual and the modified Aztec diamonds and we deduce a version of the …
-
Symmetric covers of graphs and maps
… graph can be measured by its automorphism group. Graphs with a high degree of symmetry are interesting from mathematical and aesthetic perspectives, and have also proved useful in practical contexts such as the design of efficient networks (with good broadcast or distribution properties). In …
-
Graph Coverings with Few Eigenvalues or No Short Cycles
This thesis addresses the extent of the covering graph construction. How much must a cover X resemble the graph Y that it covers? How much can X deviate from Y? The main statistics of X and Y which we will measure are their regularity, the spectra of their adjacency matrices, and the length of …
-
Factorization Systems for Discrete Homotopy Theory
… developed for the mathematical objects called graphs. In this thesis, I further develop one of these homotopy theories for graphs, called A-homotopy theory, by constructing a covering graph theory, completing the work of my Master’s thesis. Covering graphs allow us to factor graph homomorphisms …
-
Indecomposability and signed domination in graphs
… for over a decade. Indecomposability refers to graphs that have only trivial intervals. An interval is a set of vertices such that all vertices in this set have the same connections with respect to vertices outside the set. Trivial intervals are defined to be the empty set, the complete set, and …