Sökning: "topological graph theory"

Hittade 5 avhandlingar innehållade orden topological graph theory.

  1. 1. Topological Combinatorics

    Författare :Alexander Engström; Svante Linusson; Günter M. Ziegler; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Sammanfattning : This thesis on Topological Combinatorics contains 7 papers. All of them but paper Bare published before.In paper A we prove that!i dim ˜Hi(Ind(G);Q) ! |Ind(G[D])| for any graph G andits independence complex Ind(G), under the condition that G\D is a forest. LÄS MER

  3. 2. Optimal and Hereditarily Optimal Realizations of Metric Spaces

    Författare :Alice Lesser; Svante Janson; Lars-Erik Persson; Anders Johansson; Vincent Moulton; Pierre Flener; Charles Semple; Uppsala universitet; []
    Nyckelord :Applied mathematics; optimal realization; hereditarily optimal realization; tight span; phylogenetic network; Buneman graph; split decomposition; T-theory; finite metric space; topological graph theory; discrete geometry; Tillämpad matematik;

    Sammanfattning : This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies the problem of finding an optimal realization of a given finite metric space: a weighted graph which preserves the metric's distances and has minimal total edge weight. This problem is known to be NP-hard, and solutions are not necessarily unique. LÄS MER

  4. 3. Simplicial Complexes of Graphs

    Författare :Jakob Jonsson; Anders Björner; John Shareshian; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; simplicial complex; monotone graph property; discrete Morse theory; simplicial homology; homotopy type; connectivity degree; Cohen-Macaulay complex; Euler characteristic; decision tree; Algebra och geometri; Algebra and geometry; Algebra och geometri;

    Sammanfattning : Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. LÄS MER

  5. 4. Phase transitions and phase frustration in multicomponent superconductors

    Författare :Daniel Weston; Egor Babaev; Mats Wallin; Ilya Eremin; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Fysik; Physics;

    Sammanfattning : Multicomponent superconductors described by several complex matter fields have properties radically different from those of their single-component counterparts. Examples include partially ordered phases and spontaneous breaking of time-reversal symmetry due to frustration between Josephson-coupled components. LÄS MER

  7. 5. Transient Control for Leader-follower Multi-agent Systems with Application to Spatiotemporal Logic Tasks

    Författare :Fei Chen; Dimos V. Dimarogonas; Jana Tumova; Ming Cao; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; multi-agent systems; leader-follower networks; transient constraints; temporal logics; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Over the past few decades, significant research has been directed towards addressing the problem of distributed control of multi-agent systems. The overall tasks include consensus, formation, flocking, and coverage control with the wide applications in multi-robot coordination, manufacturing and intelligent transportation systems. LÄS MER