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 “"Graph automorphisms"”.

  1. Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms

    Graphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. …

    calpoly Repository record for Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms (opens in a new tab)

  2. Hitchin and calabi-yau integrable systems

    … diagrams are non-simply-laced (BCFG) by using graph automorphisms of simply-laced Dynkin diagrams. This requires a detailed analysis of some aspects of singularities of type BCFG as introduced by Slodowy. To obtain the global result over a good locus in the Hitchin base we employ Morihiko …

    freiburg-diss Repository record for Hitchin and calabi-yau integrable systems (opens in a new tab)

  3. Totally Reflected Groups

    … set S such that each edge in the Cayley graph Gamma(G,S) is inverted by some color-preserving reflection on the graph. For example, we will show that Coxeter groups and right-angled Artin groups are totally reflected and that a finitely generated abelian group is totally reflected if and …

    oklahoma-thes Repository record for Totally Reflected Groups (opens in a new tab)

  4. Symmetry in Graph Learning

    Graphs are ubiquitous representations to capture complex interactions and structural patterns. Graph neural networks have emerged as popular machine learning tools to learn and reason with graph data. Despite their promise and some success stories, graph neural networks have not managed to …

    jhu Repository record for Symmetry in Graph Learning (opens in a new tab)

  5. Reconstructing a graph from its edge-contractions

    … conjecture. It states that all simple graphs with at least four edges are reconstructible, that is they are uniquely determined from their collection of single edge contraction minors, called the deck. Similar questions have been studied in the past, the vertex reconstruction conjecture …

    ottawa-retro Repository record for Reconstructing a graph from its edge-contractions (opens in a new tab)

  6. Topology, Geometry, and Combinatorics of Fine Curve Graphs

    The goal of this thesis is to explore curve graphs, which are combinatorial tools that encode topological information about surfaces. We focus on variants of the fine curve graph of a surface, which has its vertices essential simple closed curves on the surface and whose edges connect pairs of …

    gatech Repository record for Topology, Geometry, and Combinatorics of Fine Curve Graphs (opens in a new tab)