Search for dissertations about: "GRAPHS"
Showing result 21 - 25 of 296 swedish dissertations containing the word GRAPHS.
-
21. Symmetry in Randomness : Additive Functionals and Symmetries of Random Trees and Tree-Like Graphs
Abstract : Properties of symmetries in random trees and tree-like graphs are explored. The primary structures studied are Galton-Watson trees, unlabeled unordered trees as well as labeled subcritical graphs. READ MORE
-
22. On minimal triangle-free Ramsey graphs
Abstract : A graph G is called a minimal Ramsey (3, k; n)-graph if it has the least amount of edges, e(3, k; n), possible given that G is triangle-free, has independence number α(G) < k an has n vertices. The numbers e(3, k; n) and the minimalRamsey graphs are directly related to the Ramsey numbers R(3, k). READ MORE
-
23. Learning with Geometric Embeddings of Graphs
Abstract : Graphs are natural representations of problems and data in many fields. For example, in computational biology, interaction networks model the functional relationships between genes in living organisms; in the social sciences, graphs are used to represent friendships and business relations among people; in chemoinformatics, graphs represent atoms and molecular bonds. READ MORE
-
24. Local Conditions for Cycles in Graphs
Abstract : A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian has been studied extensively, and there are many known sufficient conditions for Hamiltonicity. READ MORE
-
25. Random graph models and their applications
Abstract : This thesis explores different models of random graphs. The first part treats a change from the preferential attachment model where the network incorporates new vertices and attach them preferentially to the previous vertices with a large number of connections. READ MORE