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 20 of 504 for “"Subgraphs"”.

  1. Extremal properties of degree sequences: potential functions for subgraphs and forbidden subgraphs

    … number of edges, but they may not have the same subgraphs. In 1991 Erdős, Jacobson, and Lehel, introduced the concept of the `potential function' of a graph H: the least number of edges in a graph on n vertices for which some other graph with the same degree sequence contains a copy of a fixed …

    manitoba Repository record for Extremal properties of degree sequences: potential functions for subgraphs and forbidden subgraphs (opens in a new tab)

  2. Mining Representative Cohesive Dense Subgraphs

    Data mining techniques have an important implication in social and biological network analysis, were we're interested in finding related complexes and communities. A modern paradigm for solving this problem involves finding densely connected interacting members such as bound proteins in a PPI. It's …

    ndsu Repository record for Mining Representative Cohesive Dense Subgraphs (opens in a new tab)

  3. Brick Generation and Conformal Subgraphs

    A nontrivial connected graph is matching covered if each of its edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played key roles in the theory of these graphs. Any tight cut decomposition of a …

    waterloo Repository record for Brick Generation and Conformal Subgraphs (opens in a new tab)

  4. Packing and embedding large subgraphs

    This thesis contains several embedding results for graphs in both random and non random settings. Most notably, we resolve a long standing conjecture that the threshold probability for Hamiltonicity in the random binomial subgraph of the hypercube equals $1/2$. %posed e.g.~by Bollob\'as, In Chapter …

    birmingham Download PDF for Packing and embedding large subgraphs (opens in a new tab)

  5. Monochromatic Subgraphs in Multiplex Networks

    … we study the joint distribution of monochromatic subgraphs for dense multiplex networks, that is, networks with multiple layers. Specifically, given a finite collection of graphs $H_1,\ldots,H_d$, we derive the asymptotic joint distribution of $\bm T_n:= (T(H_1, G_n^{(1)}),\ldots, T(H_d, …

    penn Repository record for Monochromatic Subgraphs in Multiplex Networks (opens in a new tab)

  6. Forbidden subgraphs and 3-colorability

    Classical vertex coloring problems ask for the minimum number of colors needed to color the vertices of a graph, such that adjacent vertices use different colors. Vertex coloring does have quite a few practical applications in communication theory, industry engineering and computer science. Such …

    gatech Repository record for Forbidden subgraphs and 3-colorability (opens in a new tab)

  7. Vertex coloring with forbidden subgraphs

    … of the line graphs in terms of forbidden subgraphs. By using {\it clique-width} and {\it perfect graphs} theory, we show that ($claw$,$4K_1$,$hole$-$twin$)-free graphs and ($4K_1$,$hole$-$twin$,$5$-$wheel$)-free graphs are either perfect or have bounded clique-width. And thus the coloring …

    wilfrid-laurier Repository record for Vertex coloring with forbidden subgraphs (opens in a new tab) Download PDF for Vertex coloring with forbidden subgraphs (opens in a new tab)

  8. Edge-packing by isomorphic subgraphs

    Maximum G Edge-Packing (E Pack<sub>G</sub>) is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. The problem is primarily considered for several guest graphs (stars, paths and cycles) and host graphs (arbitrary graphs, planar …

    vt Repository record for Edge-packing by isomorphic subgraphs (opens in a new tab)

  9. Extremal problems involving forbidden subgraphs

    … we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family of hypergraphs. In Chapter 2, we consider improper coloring of graphs without short cycles. We find how sparse an improperly critical graph can be when it has …

    uiuc Repository record for Extremal problems involving forbidden subgraphs (opens in a new tab)

  10. Finding Interesting Subgraphs with Guarantees

    … as connectivity or a minimum density. Finding subgraphs that satisfy common constraints of interest, such as the ones above, is computationally hard in general, and state-of-the-art algorithms for many problems in network analysis are heuristic in nature. These methods are fast and usually easy …

    vt Repository record for Finding Interesting Subgraphs with Guarantees (opens in a new tab)

  11. Mining Small Subgraphs in Massive Graphs

    … problems require that we find and locate all subgraphs of specific patterns within a given graph. This task is not trivial when we are dealing with massive graphs, of millions or even billions of nodes and edges. In particular, it becomes harder when we want to get it done within a limited …

    uvic Repository record for Mining Small Subgraphs in Massive Graphs (opens in a new tab)

  12. The hyperspace graph of connected subgraphs

    … graph G, the hyperspace graph of connected subgraphs C (G) is defined. The graph C (G) is such that every vertex represents a connected subgraph of G. It is shown that every connected graph G has a unique graph C (G). A characterization of a path, a cycle and the 3-star by their …

    wvu Repository record for The hyperspace graph of connected subgraphs (opens in a new tab)

  13. Minimum saturated subgraphs of tripartite graphs

    … this thesis we review the history of saturated subgraphs, and prove new results on saturated subgraphs of tripartite graphs. Let Ka,b,c be a compete tripartite graph, with partite sets of size a, b, and c. Specifically, we determine sat(Kn1,n2,n3,Kl,l,l), for n1≥ n2≥ n3, when n2 bounded by a …

    rit Repository record for Minimum saturated subgraphs of tripartite graphs (opens in a new tab)

  14. Algorithms for Computing Edge-Connected Subgraphs

    … of the graph. This motivates us to look for subgraphs with edge connectivity at least k in a given graph G, for an appropriately selected k value. We employ the method based on the concept of the auxiliary graph, previously proposed in the literature, for finding all maximal k-edge-connected …

    tamu Repository record for Algorithms for Computing Edge-Connected Subgraphs (opens in a new tab)

  15. Optimal Graph Coverings with Connected Subgraphs

    … the goal is to partition a graph into connected subgraphs of similar ``size'' with the objective to make each subgraph as compact (``round-shaped'') as possible. We overview several methods to measure the compactness and to formulate this problem in terms of integer programs. We dive deep into …

    fu-berlin Repository record for Optimal Graph Coverings with Connected Subgraphs (opens in a new tab)

  16. On coloring digraphs with forbidden induced subgraphs

    … field of $\chi$-boundedness studies the induced subgraphs that need to be present in a graph with high chromatic number. In this thesis, we study the equivalent of $\chi$-boundedness but with dichromatic number instead. In particular, we study the induced subgraphs of digraphs with high …

    waterloo Repository record for On coloring digraphs with forbidden induced subgraphs (opens in a new tab)

Page 1 of 26