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 22 for “"tree graphs"”.

  1. Tree Graphs and Orthogonal Spanning Tree Decompositions

    Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as …

    portland-state Repository record for Tree Graphs and Orthogonal Spanning Tree Decompositions (opens in a new tab)

  2. On the Discrete Number of Tree Graphs

    … Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to …

    vt Repository record for On the Discrete Number of Tree Graphs (opens in a new tab)

  3. The Existence of Hamilton Circuits in Tree Graphs

    Made available in DSpace on 2014-12-04T21:03:33Z (GMT). No. of bitstreams: 1 6303224.pdf: 2038745 bytes, checksum: 9ca01744dcf5c64d2c391017edf110d1 (MD5) Previous issue date: 1962

    uiuc Repository record for The Existence of Hamilton Circuits in Tree Graphs (opens in a new tab)

  4. On the Ramsey numbers of tree graphs versus certain generalised wheel graphs

    … thesis presents a series of Ramsey results on tree graphs versus generalised wheel graphs, with the focus on the generalised wheel graphs $W_{s,6}$ and $W_{s,7}$ and the wheel graph $W_8$. This thesis consists of 7 chapters. In Chapter 1, we give a brief historical introduction to Ramsey theory …

    unsw Repository record for On the Ramsey numbers of tree graphs versus certain generalised wheel graphs (opens in a new tab)

  5. Contractible Theta Complexes of Graphs

    <p>We examine properties of graphs that result in the graph having a contractible theta complex. We classify such properties for tree graphs and graphs with one loop and we introduce examples of graphs with such properties for tree graphs and graphs with one or two loops. For more general graphs, …

    ut-knoxville Repository record for Contractible Theta Complexes of Graphs (opens in a new tab)

  6. Optimal Design of Reconfigurable Products Considering Product Configurations and Reconfiguration Processes

    … processes.First, a generic design AND-OR tree is used to model design candidates and design parameters based on the same requirements, and generic process AND-OR graphs are employed to model reconfiguration process candidates and process parameters. Specific design and reconfiguration …

    calgary Repository record for Optimal Design of Reconfigurable Products Considering Product Configurations and Reconfiguration Processes (opens in a new tab)

  7. Signal propagation on a network

    … of network topologies, which include path graphs, tree graphs, Y-shaped graphs, and square grid graphs. We employ mathematical models, including the diffusion equation, the Fisher equation, and the FitzHugh-Nagumo equations, to describe concentration and excitation across networks. Using …

    east-anglia Download PDF for Signal propagation on a network (opens in a new tab)

  8. Analysis of Self-Similarity in Phylogenetic Trees

    … a porous media are all modeled and studied using tree graphs. In many cases, such tree networks are self-similar, retaining their statistical structure on different levels of the hierarchy. The most studied particular class of self-similar trees is so-called Tokunaga model, which is a …

    unr Repository record for Analysis of Self-Similarity in Phylogenetic Trees (opens in a new tab)

  9. An evaluation on the gracefulness and colouring of graphs

    … and assessing it alongside a very unique set of graphs called graceful graphs. The two topic areas, although not mixed together often, nicely support each other in introducing various findings from each of the topics. We will start by investigating graceful graphs and determining what classes of …

    whiterose Download PDF for An evaluation on the gracefulness and colouring of graphs (opens in a new tab)

  10. Optimal broadcasting in treelike graphs

    … is solved polynomially only for a few classes of graphs. In this thesis we study the broadcast problem in different classes of graphs which have various similarities to trees. The unicyclic graph is the simplest graph family after trees, it is a connected graph with only one cycle in it. We …

    concordia Download PDF for Optimal broadcasting in treelike graphs (opens in a new tab)

  11. Dynamic Optimization of Transportation Networks with Delays

    … the results are extended to handle directed tree graphs, more general cost functions, and variable production in the network. In all cases the optimal control can be found by sweeping through the graph once, calculating aggregate utilities and levels. This gives a serial implementation, that …

    lund Repository record for Dynamic Optimization of Transportation Networks with Delays (opens in a new tab) Download PDF for Dynamic Optimization of Transportation Networks with Delays (opens in a new tab)

  12. DISTRIBUTED ESTIMATION OF CENTRALITY MEASURES IN COMPLEX NETWORKS

    … nor high memory usages. Specifically, for tree graphs, the introduced variables are linearly and non-singularly related. Thus, by turning these constraints into a state equation, and the centrality measure function into an output equation, we subsequently obtain a networked dynamical system …

    oklahoma-thes Repository record for DISTRIBUTED ESTIMATION OF CENTRALITY MEASURES IN COMPLEX NETWORKS (opens in a new tab)

  13. Conditional covering problem: Study of complexity and optimization methods

    … of time. While the CCP is NP-Hard on general graphs, we will present a quadratic algorithm that will find optimal solutions to CCP on path and extended star graphs (multiple path graphs with one node in common). We will then present a polynomial time algorithm for tree graphs building off the …

    arizona-thes Repository record for Conditional covering problem: Study of complexity and optimization methods (opens in a new tab)

  14. Common Operating Picture Enhancement for Cyber-Physcial Data and Under Contingencies

    … analytical methodologies, such as attack tree graphs and a method called Failure Modes, Effects, and Criticality Analysis (FMECA), to comprehensively identify and address potential risks and threats to the system. In conclusion, the results underscore the potential insights derived from …

    tamu Repository record for Common Operating Picture Enhancement for Cyber-Physcial Data and Under Contingencies (opens in a new tab)

  15. On aspects of Ramsey theory

    … particularly, Ramsey-type theorems concerning graphs and families of sets. This thesis consists of 8 chapters. In Chapter 1, we give a brief historical introduction to Ramsey Theory. Then, we introduce some necessary notation and definitions that will be consistently used throughout the thesis, …

    unsw Repository record for On aspects of Ramsey theory (opens in a new tab)

  16. General Risk Literacy Skills are Causally Related to Improved Self-Evaluations: Training Graph Literacy Improves Decision Making and Lowers Overconfidence

    … bar, pie, line, icon arrays, and decision tree graphs). Statistical and structural modeling results revealed that the graph literacy tutor causally improved graph literacy skills, which in turn causally reduced biases on several untrained, conceptually distinct decision tasks (framing …

    oklahoma-thes Repository record for General Risk Literacy Skills are Causally Related to Improved Self-Evaluations: Training Graph Literacy Improves Decision Making and Lowers Overconfidence (opens in a new tab)

  17. Static and sequential location-allocation problems on networks and areas with probabilistic demands

    … analysis forms the basis for similar problems on trees and graphs with isolated cycles. These problems are then extended to multiperiod versions in which demands may change dynamically over time periods and at mostly one facility can be located per time period. Chain and tree graphs are considered …

    vt Repository record for Static and sequential location-allocation problems on networks and areas with probabilistic demands (opens in a new tab)

  18. Three essays in supply chain management

    … and deliveries (VRPD problem) on some special graphs. Some vertices on the graph represent delivery customers, and other vertices represent pickup customers. The objective is to find a minimum length tour for a capacitated vehicle, which starts at a depot and travels on the graph while …

    ubc Repository record for Three essays in supply chain management (opens in a new tab) Download PDF for Three essays in supply chain management (opens in a new tab)

  19. Coordination and Privacy Preservation in Multi-Agent Systems

    … phase distribution under chain or directed tree graphs. More importantly, different from existing global synchronization studies on decentralized PCO networks, our work allows heterogeneous coupling functions and perturbations on PCOs' natural frequencies, and our results hold under any …

    clemson Repository record for Coordination and Privacy Preservation in Multi-Agent Systems (opens in a new tab)

  20. Basal Graph Structures for Geometry Based Organization of Wide-Baseline Image Collections

    … relations between the images. We use these basal graphs for geometric walkthroughs and detection of noisy location (GPS) and orientation (magnetometer) information that may be stored with each image. We have five algorithmic contributions. First, we propose an algorithm BLOGS (Balanced Local and …

    usf Repository record for Basal Graph Structures for Geometry Based Organization of Wide-Baseline Image Collections (opens in a new tab)

Page 1 of 2