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 20 for “"Petersen Graph"”.

  1. Excluding Two Minors of the Petersen Graph

    … we begin with a brief survey of the Petersen graph and its role in graph theory. We will then develop an alternative decomposition to clique sums for 3-connected graphs, called T-sums. This decomposition will be used in Chapter 2 to completely characterize those graphs which have no …

    lsu-thes Repository record for Excluding Two Minors of the Petersen Graph (opens in a new tab)

  2. Refined Inertias Related to Biological Systems and to the Petersen Graph

    … allowed by sign patterns with specific digraph structures have been studied, for example, for tree sign patterns. In the second part of this thesis, such results on refined inertias are extended by considering sign and zero-nonzero patterns with digraphs isomorphic to strongly connected …

    uvic Repository record for Refined Inertias Related to Biological Systems and to the Petersen Graph (opens in a new tab)

  3. Independent Domination in Complementary Prisms.

    Let G be a graph and G̅ be the complement of G. The complementary prism GG̅ of G is the graph formed from the disjoint union of G and G̅ by adding the edges of a perfect matching between the corresponding vertices of G and G̅. For example, if G is a 5-cycle, then GG̅ is the Petersen graph. In this …

    etsu Repository record for Independent Domination in Complementary Prisms. (opens in a new tab) Download PDF for Independent Domination in Complementary Prisms. (opens in a new tab)

  4. Four Color Theorem

    … sets, the method of discharging, and the Petersen Graph are all covered in this report. There is also a brief discussion over the importance of a mathematical proof and how the definition of a proof has changed with the contributions of Computer Science to the mathematical community.

    texas Repository record for Four Color Theorem (opens in a new tab)

  5. Designs on Cubic Multigraphs

    … conditions are found for the existence of graph designs on cubic multigraphs. It is shown that, with a few given exceptions, these conditions are sufficient for all connected cubic multigraphs on six or fewer vertices, and for four of the five disconnected ones. Partial results are obtained …

    mcmaster Repository record for Designs on Cubic Multigraphs (opens in a new tab)

  6. Edge-colorings and flows in Class 2 graphs

    We consider edge-colorings and flows problems in Graph Theory that are hard to solve for Class 2 graphs. Most of them are strongly related to some outstanding open conjectures, such as the Cycle Double Cover Conjecture, the Berge-Fulkerson Conjecture, the Petersen Coloring Conjecture and the …

    trento Repository record for Edge-colorings and flows in Class 2 graphs (opens in a new tab)

  7. Symmetric covers of graphs and maps

    The symmetry of a combinatorial graph can be measured by its automorphism group. Graphs with a high degree of symmetry are interesting from mathematical and aesthetic perspectives, and have also proved useful in practical contexts such as the design of efficient networks (with good broadcast or …

    auckland-ms Repository record for Symmetric covers of graphs and maps (opens in a new tab)

  8. Hamilton Paths in Generalized Petersen Graphs

    … > 3<i>k</i> with <i>k</i> > 2, the generalized Petersen graph, <i>GP</i>(<i>n,k</i>) is Hamilton-laceable if <i>n</i> is even and <i>k</i> is odd, and it is Hamilton-connected otherwise. We take the first step in the proof of this conjecture by proving the case <i>n</i> = 3<i>k</i> + 1 and …

    waterloo Repository record for Hamilton Paths in Generalized Petersen Graphs (opens in a new tab)

  9. The Game of Nim on Graphs

    … to combinatorial games. Nim was extended to graphs by taking a fixed graph with a playing piece on a given vertex and assigning positive integer weight to the edges that correspond to a pile of stones in the ordinary game of Nim. Players move alternately from the playing piece across incident …

    ndsu Repository record for The Game of Nim on Graphs (opens in a new tab)

  10. On Randic Energy of Graphs

    In this research, we explore the subject of graph energy. We first discuss the connections between linear algebra and graph theory and review some important definitions and facts of these two fields. We introduce graph energy and provide some historical perspectives on the subject. Known results of …

    ucf Repository record for On Randic Energy of Graphs (opens in a new tab)

  11. Bipartite Density of Generalized Petersen Graphs

    The bipartite density b(G) of a graph G with m edges is the maximum ratio [special characters omitted] where m0 is the number of edges in a bipartitesubgraph of G. In this study we determine the bipartite density of several classes of Generalized Petersen Graphs. These graphs are denoted by P(n, …

    mississippi Repository record for Bipartite Density of Generalized Petersen Graphs (opens in a new tab)

  12. Ordered Interval Routing Schemes

    … of those edges. Our results on a number of graphs show that using an OIRS instead of an IRS reduces the size of the routing tables in the case of <i>optimal</i> routing, i. e. , routing along shortest paths. We show that optimal routing in any <i>k</i>-tree is possible using an OIRS with at …

    waterloo Repository record for Ordered Interval Routing Schemes (opens in a new tab)

  13. 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)

  14. Eulerian subgraphs and Hamiltonicity of claw -free graphs

    Let C(l, k) denote the class of 2-edge-connected graphs of order n such that a graph G ∈ C(l, k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G - S has order at least n-kl . We prove that If G ∈ C(6, 0), then G is supereulerian if and only if G cannot be contracted to …

    wvu Repository record for Eulerian subgraphs and Hamiltonicity of claw -free graphs (opens in a new tab)

  15. Matching structure and Pfaffian orientations of graphs

    … theorem for bricks. A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of a decomposition procedure of Kotzig, and Lovasz and Plummer. We …

    gatech Repository record for Matching structure and Pfaffian orientations of graphs (opens in a new tab)

  16. Integer flow and Petersen minor

    Tutte [45] conjectured that every bridgeless Petersen-minor free graph admits a nowhere-zero 4-flow. Let P10 m&d1; ) be the graph obtained from the Petersen graph by contracting mu edges from a perfect matching. In chapter 1 we prove that every bridgeless P10 3&d1; -minor free graph admits a …

    wvu Repository record for Integer flow and Petersen minor (opens in a new tab)

  17. Topological Approaches to Chromatic Number and Box Complex Analysis of Partition Graphs

    Determining the chromatic number of the partition graph P(33) poses a considerable challenge. We can bound it to 4 ≤ χ(P(33)) ≤ 6, with exhaustive search confirming χ(P(33)) = 6. A potential mathematical proof strategy for this equality involves identifying a Z2-invariant S4 with non-trivial …

    ottawa-retro Repository record for Topological Approaches to Chromatic Number and Box Complex Analysis of Partition Graphs (opens in a new tab)

  18. Dynamics on networks

    … consider two dynamical models whose underlying graph can be represented by a single network. We first consider the Kuramoto model, a canonical model of coupled phase oscillators. We obtain two results on its partial phase-locked state, where a subset of oscillators remain close in phase while …

    uiuc Repository record for Dynamics on networks (opens in a new tab)

  19. Groups, Graphs, and Symmetry-Breaking

    A labeling of a graph G is said to be r-distinguishing if no automorphism of G preserves all of the vertex labels. The smallest such number r for which there is an r-distinguishing labeling on G is called the distinguishing number of G. The distinguishing set of a group Gamma, D(Gamma), is the set …

    vt Repository record for Groups, Graphs, and Symmetry-Breaking (opens in a new tab)

  20. CONSTRUCTING GRAPHS FOR INTERCONNECTION NETWORK TOPOLOGIES

    … networks. We then move on to develop a graph-theoretic method of constructing topological structures based on two classes of graphs known as group and quasi-group graphs and their products. We show that many well-known topologies, such as the hypercubes, the complete graphs and the …

    nus Repository record for CONSTRUCTING GRAPHS FOR INTERCONNECTION NETWORK TOPOLOGIES (opens in a new tab) Download file for CONSTRUCTING GRAPHS FOR INTERCONNECTION NETWORK TOPOLOGIES (opens in a new tab)