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 “"Split graph"”.

  1. On Induced Subgraphs, Degree Sequences, and Graph Structure

    Finally, we define the A4-structure H of a graph G to be the 4-uniform hypergraph on the vertex set of G where four vertices comprise an edge in H if and only if they form the vertex set of an alternating 4-cycle in G. Our definition is a variation of the notion of the P4-structure, a hypergraph …

    uiuc Repository record for On Induced Subgraphs, Degree Sequences, and Graph Structure (opens in a new tab)

  2. Cyclability: combinatorial properties, algorithms and complexity

    A graph G is called k-cyclable, if for every k of its vertices there exists a cycle in G that contains them. The cyclability of G is the maximum integer k for which G is k-cyclable and it is a connectivity related graph parameter. In this doctoral thesis we study, mainly from the Parameterized …

    greece Repository record for Cyclability: combinatorial properties, algorithms and complexity (opens in a new tab)

  3. Leader-follower consensus under peer-pressure in complex networks

    … process. We conjecture that an special type of graph, that we call complete split graph, is related with the maximization of the index, and based on this conjecture we study the relative distance-sum heterogeneity of random graphs and different real-world networks, which allows us to …

    strathclyde Repository record for Leader-follower consensus under peer-pressure in complex networks (opens in a new tab)

  4. Algorithms and complexity of graph modification problems

    Graph modification problems play important role in both structural and algorithmic graph theory. These problems have been studied for decades and find a large number of practical applications in several different fields in real world. In this thesis, we study a famous edge deletion problem, known …

    greece Repository record for Algorithms and complexity of graph modification problems (opens in a new tab)

  5. Essays on Network formation games

    … friends. As a result, We present that nested split graphs are drawn from survey data because researchers tend to ask respondents to list only a few friends.

    vt Repository record for Essays on Network formation games (opens in a new tab)

  6. Edge modification on perfect and reducible graphs with application to watermarking

    In graph modification problems, we have to repair, improve, or adjust a graph to satisfy appropriate properties while minimizing the cost of the modification. The study of graph modification problems is crucial to computer science as they find applications in different areas, such as biology, …

    greece Repository record for Edge modification on perfect and reducible graphs with application to watermarking (opens in a new tab)