Essays about: "complete graph"

Showing result 1 - 5 of 41 essays containing the words complete graph.

  1. 1. Distance Consistent Labellings and the Local List Number

    University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Author : Anders Henricsson; [2023]
    Keywords : distance-consistence; graph labelling; graph distance; avstånds-konsistens; grafmärkning; grafavstånd;

    Abstract : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). READ MORE

  3. 2. The cosmological polytope of the complete bipartite graph K_{2,n}

    University essay from KTH/Matematik (Avd.)

    Author : Erik Landin; [2023]
    Keywords : Polytopes; Cosmological polytopes; Gröbner bases; Graphs; Polytop; Kosmologiska polytop; Gröbner baser; Grafer;

    Abstract : A cosmological polytope of an undirected connected graph is a lattice polytope which when the graph is interpreted as a feynman diagram can be used to calculate the contribution of that feynman diagram to the wavefunction of some cosmological models. This contribution can be calculated using the canonical form of the cosmological polytope, which can be computed by taking the sum of the canonical forms of the facets of a subdivision of the cosmological polytope. READ MORE

  4. 3. Methods from Linear Algebra for the Enumeration of Spanning Trees

    University essay from KTH/Skolan för teknikvetenskap (SCI)

    Author : Nils Forsgren; [2023]
    Keywords : Spanning Tree Enumeration;

    Abstract : In this report, we study the enumeration of spanning trees in graphs, using two methods withinlinear algebra, Kirchhoff’s Matrix Tree Theorem and an alternative method, also referred to asLemma 1, derived by S. Klee and M.T Stamps in [KS20]. READ MORE

  5. 4. An Attribution Method for Alerts in an Educational Cyber Range based on Graph Database

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Yang Wang; [2023]
    Keywords : Network Attribution. Cyber Range; Ethical Hacking Course. Graph Database.; Nätverksattribuering; Cyberområde; Etisk Hackningskurs; Grafisk Databas;

    Abstract : Finding the source of events in a network is a critical problem in network security, and this process is called network attribution. This thesis develops a system to attribute alerts from the cyber range of the Ethical Hacking Course at KTH to students. The cyber range is an essential component of the Ethical Hacking course. READ MORE

  6. 5. Machine Learning-Based Instruction Scheduling for a DSP Architecture Compiler : Instruction Scheduling using Deep Reinforcement Learning and Graph Convolutional Networks

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Lucas Alava Peña; [2023]
    Keywords : Instruction Scheduling; Deep reinforcement Learning; Compilers; Graph Convolutional Networks; Schemaläggning av instruktioner; Deep Reinforcement Learning; kompilatorer; grafkonvolutionella nätverk;

    Abstract : Instruction Scheduling is a back-end compiler optimisation technique that can provide significant performance gains. It refers to ordering instructions in a particular order to reduce latency for processors with instruction-level parallelism. READ MORE