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 225 for “"Directed graphs"”.

  1. Directed Graphs and Applications

    Directed graphs have widespread applicability, so there is continued need for both computational and theoretical improvements. We extend the standard methodology in three different ways, which constitute the main chapters of the thesis. In spatial settings, information about data collection …

    tamu Repository record for Directed Graphs and Applications (opens in a new tab)

  2. Magic labelings of directed graphs

    Let G be a directed graph with a total labeling. The additive arc-weight of an arc xy is the sum of the label on xy and the label on y. The additive directed vertex-weight of a vertex x is the sum of the label on x and the labels on all arcs with head at x. The graph is additive arc magic if all …

    uvic Repository record for Magic labelings of directed graphs (opens in a new tab)

  3. On cycles in directed graphs

    The main results of this thesis are the following. We show that for each alpha > 0 every sufficiently large oriented graph G with minimum indegree and minimum outdegree at least 3 |G| / 8 + alpha |G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen. …

    birmingham Download PDF for On cycles in directed graphs (opens in a new tab)

  4. A∞-algebras on directed graphs

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms

    uiuc Repository record for A∞-algebras on directed graphs (opens in a new tab)

  5. Large structures in dense directed graphs

    … answer questions in extremal combinatorics, for directed graphs. Specifically, we investigate which large tree-like directed graphs are contained in all dense directed graphs of large order. More precisely, let T be an oriented tree of order n; among others, we establish the following results. …

    birmingham Download PDF for Large structures in dense directed graphs (opens in a new tab)

  6. Scaling limist of critical directed graphs

    … limit of connected components in critical undirected random graphs has been well studied and shown to be universal between different critical models of undirected random graphs. Work by Goldschmidt and Stephenson has established the scaling limit of a the strongly connected components of …

    oxford Repository record for Scaling limist of critical directed graphs (opens in a new tab)

  7. Forest Generating Functions of Directed Graphs

    … over both the vertex and edge sets of a given directed graph. In this thesis, we establish a general framework to study spanning forest polynomials, associating them with a generalized Laplacian matrix and studying its properties. We introduce a novel proof of the famous matrix-tree theorem and …

    portland-state Repository record for Forest Generating Functions of Directed Graphs (opens in a new tab)

  8. Directed Graphs: Fixed-Parameter Tractability & Beyond

    Most interesting optimization problems on graphs are NP-hard, implying that (unless P=NP) there is no polynomial time algorithm that solves all the instances of an NP-hard problem exactly. However, classical complexity measures the running time as a function of only the overall input size. The …

    maryland Repository record for Directed Graphs: Fixed-Parameter Tractability & Beyond (opens in a new tab)

  9. Universal operator algebras of directed graphs

    We investigate universal operator algebras of directed graphs. We begin with the constructions of the universal operator algebra and universal C*-algebra of a directed graph. We show that each universal algebra can be decomposed as a free product of algebras associated to subgraphs. We also …

    nebraska Repository record for Universal operator algebras of directed graphs (opens in a new tab)

  10. Analysis and visualization of directed graphs

    The display of Graphs, is widely used for the visualization of data or information. Although it is important to show all the information represented by the edges and the nodes of the graph, there are cases where this is either impossible due to the complexity and the size of the graphs or even …

    greece Repository record for Analysis and visualization of directed graphs (opens in a new tab)

  11. Diagrammatic Categories which arise from Directed Graphs

    There is a categorical equivalence between the Temperley--Lieb category $TL(2)$ and the full subcategory of $SU(2)$-\textbf{mod} with objects given by $V^{\otimes k}$ where $V$ is the tautological $SU(2)$-module and $k$ is a non-negative integer. The first results in this dissertation develop new …

    oklahoma-thes Repository record for Diagrammatic Categories which arise from Directed Graphs (opens in a new tab)

  12. Parking Functions on Trees and Directed Graphs

    … and answers in the case of certain families of graphs. We begin by generalizing the underlying parking lot to a general digraph and give several equivalent characterizations. We then start by building on recent work in the case that the parking lot is a tree with edges directed towards a root. …

    tamu Repository record for Parking Functions on Trees and Directed Graphs (opens in a new tab)

  13. Complexity of Dyck-reachability in directed graphs

    We study the problem of Dyck-reachability in directed graphs de ned as follows: given a directed graph with edges labeled by either open or close parentheses, we claim that a vertex is Dyck-reachable from another if there is a path between these two vertices such that the string described by …

    uiuc Repository record for Complexity of Dyck-reachability in directed graphs (opens in a new tab)

  14. Link scheduling directed graphs using undirected edge colours

    … network is typically modeled as either a directed or an undirected communication graph. Link scheduling is the problem of assigning time slots to each edge so that communication on every edge at its assigned time may occur without interference. Interference is also modeled as a graph, …

    ubc Repository record for Link scheduling directed graphs using undirected edge colours (opens in a new tab) Download PDF for Link scheduling directed graphs using undirected edge colours (opens in a new tab)

  15. Extremal problems on graphs, directed graphs and hypergraphs

    … thesis is concerned with extremal problems on graphs and similar structures. We first study degree conditions in uniform hypergraphs that force matchings of various sizes. Our main result in this area improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect …

    birmingham Download PDF for Extremal problems on graphs, directed graphs and hypergraphs (opens in a new tab)

  16. The regularity method in directed graphs and hypergraphs

    … G on 2n − 2 vertices contains a copy of any directed tree T on n vertices. An analysis of the extremal cases then proves that Sumner’s universal tournament conjecture holds for any sufficiently large n. Our methods are also applied to the problem of obtaining hypergraph analogues of Dirac’s …

    birmingham Download PDF for The regularity method in directed graphs and hypergraphs (opens in a new tab)

  17. Certain Resolvable Directed Cycle Decompositions of Directed Graphs

    … we resolve the last outstanding case of the directed Oberwolfach problem with tables of uniform length. More specifically, we address the case with two tables of equal odd length. To do so, we construct a resolvable decomposition of the complete symmetric directed graph into two directed …

    ottawa-retro Repository record for Certain Resolvable Directed Cycle Decompositions of Directed Graphs (opens in a new tab)

  18. Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs

    … Markov chains and explores their applications to directed graphs. We derive an explicit expression for the error term in the convergence theorem in terms of the eigenvalues of the transition matrix. This expression reveals that the convergence behaviour is governed not only by the spectral gap but …

    queens Repository record for Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs (opens in a new tab)

Page 1 of 12