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 5 of 5 for “"Graph Automorphism"”.

  1. Dynamics on networks

    … consider two dynamical models whose underlying graph can be represented by a single network. We first consider the Kuramoto model, a canonical model of coupled phase oscillators. We obtain two results on its partial phase-locked state, where a subset of oscillators remain close in phase while …

    uiuc Repository record for Dynamics on networks (opens in a new tab)

  2. A general computational tool for structure synthesis

    … concepts: (1) the structure is represented by a graph and further by the adjacency matrix; and (2) instead of only exploiting the eigenvalue of the adjacency matrix, both the eigenvalue and the eigenvector are exploited; specifically the components of the eigenvector have been found very useful …

    sask Repository record for A general computational tool for structure synthesis (opens in a new tab)

  3. Attacks On Difficult Instances Of Graph Isomorphism: Sequential And Parallel Algorithms

    The graph isomorphism problem has received a great deal of attention on both theoretical and practical fronts. However, a polynomial algorithm for the problem has yet to be found. Even so, the best of the existing algorithms perform well in practice; so well that it is challenging to find hard …

    ucf Repository record for Attacks On Difficult Instances Of Graph Isomorphism: Sequential And Parallel Algorithms (opens in a new tab)

  4. From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF)

    Resource Description Framework (RDF) is a graph-like data model designed for the web. One of its compelling features is a precise, model-theoretic semantics. We address security in the context of the RDF. We first observe that the problem of securing RDF is related closely to the more traditional …

    waterloo Repository record for From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF) (opens in a new tab)

  5. Tricyclic Steiner Triple Systems with 1-Rotational Subsystems.

    … STS(v), is said to be tricyclic if it admits an automorphism whose disjoint cyclic decomposition consists of three cycles. In this thesis we give necessary and sufficient conditions for the existence of a tricyclic STS(v) when one of the cycles is of length one. In this case, the STS(v) will …

    etsu Repository record for Tricyclic Steiner Triple Systems with 1-Rotational Subsystems. (opens in a new tab) Download PDF for Tricyclic Steiner Triple Systems with 1-Rotational Subsystems. (opens in a new tab)