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 40 for “"Cartesian Products"”.

  1. Cartesian products avoiding patterns

    … general patterns such as finding a set whose Cartesian product avoids the zero set of a given function. Previous work on the subject has considered patterns described by polynomials, or functions satisfying certain regularity conditions. We provide an exposition of some results in this …

    ubc Repository record for Cartesian products avoiding patterns (opens in a new tab) Download PDF for Cartesian products avoiding patterns (opens in a new tab)

  2. OPTIMAL ORIENTATIONS OF CARTESIAN PRODUCTS OF GRAPHS

    … x Kn) for m ? 2 and n ? 2, where G x H is the cartesian product of two graphs G and H. In general, it is difficult to find strong orientations of graphs which minimise p. However, for the graphs in question, optimal strong orientations are introduced. The results materially contribute to the …

    nus Repository record for OPTIMAL ORIENTATIONS OF CARTESIAN PRODUCTS OF GRAPHS (opens in a new tab) Download file for OPTIMAL ORIENTATIONS OF CARTESIAN PRODUCTS OF GRAPHS (opens in a new tab)

  3. The genus of cartesian products of graphs

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1969

    msu Repository record for The genus of cartesian products of graphs (opens in a new tab)

  4. Cartesian products of lens spaces and the Kunneth formula

    The graded cohomology groups of a cartesian product of two cellular spaces are expressible in terms of the cohomology groups of the factors. This relationship is given by the (split) short exact Runneth sequence. However the multiplicative structure on the cohomology of a cartesian product can in …

    ubc Repository record for Cartesian products of lens spaces and the Kunneth formula (opens in a new tab) Download PDF for Cartesian products of lens spaces and the Kunneth formula (opens in a new tab)

  5. Optimal L(h, k) labelings of Cartesian products of complete graphs and paths

    … In this thesis we analyze $L(h,k)$ labelings of Cartesian products of complete graphs and path. For $h \geq k$ we establish the minimum $L(h,k)$ span of these graphs. For $h

    rit Repository record for Optimal L(h, k) labelings of Cartesian products of complete graphs and paths (opens in a new tab)

  6. Efficient structure search in large data sets

    … we address the issue of unpromising results by Cartesian products from "dissimilar" vertices. We propose a new framework by postponing the Cartesian products based on the structure of a query to minimize the redundant Cartesian products. We also devise a new linear size auxiliary data structure …

    unsw Repository record for Efficient structure search in large data sets (opens in a new tab)

  7. Choice numbers for unions of graphs

    … of planar graphs, bipartite graphs and Cartesian products of graphs are also presented.

    uvic Repository record for Choice numbers for unions of graphs (opens in a new tab)

  8. Zombies and survivors on graph classes

    … We determine the exact zombie number of the Cartesian product of a cycle and a path, and show that this quantity depends on the parity of the cycle. Upper bounds on the zombie number for strong products, Cartesian products and lexicographic products are given. We also show that the throttling …

    manitoba Repository record for Zombies and survivors on graph classes (opens in a new tab)

  9. The group extensions problem and its resolution in cohomology for the case of an elementary abelian normal sub-group

    … problem by first constructing extensions as cartesian products and examining the connections to group cohomology.

    colostate Repository record for The group extensions problem and its resolution in cohomology for the case of an elementary abelian normal sub-group (opens in a new tab)

  10. Sidorenko's conjecture, graph norms, and pseudorandomness

    … A recursive approach to the conjecture, using Cartesian products of graphs, will also be discussed. We show that the class of graphs that satisfy the conjecture is closed under taking Cartesian products with either trees or even cycles.</p> <p>The second part studies a conjecture of Kohayakawa, …

    oxford Repository record for Sidorenko's conjecture, graph norms, and pseudorandomness (opens in a new tab)

  11. Separation axioms and minimal topologies

    … axioms under strengthenings of topologies and cartesian products are considered. Given a set X, the family of all topologies defined on X is a complete lattice. A study of topologies which are minimal in this lattice with respect to a certain separation axiom is made. We consider certain such …

    ubc Repository record for Separation axioms and minimal topologies (opens in a new tab) Download PDF for Separation axioms and minimal topologies (opens in a new tab)

  12. Very Cost Effective Partitions in Graphs

    … consider several families of graphs G, including Cartesian products and cacti graphs, to determine whether G has a very cost effective bipartition.

    etsu Repository record for Very Cost Effective Partitions in Graphs (opens in a new tab) Download PDF for Very Cost Effective Partitions in Graphs (opens in a new tab)

  13. Ultraconnected and Critical Graphs

    … and prove that ultraconnectivity is preserved by Cartesian products. We completely characterize when adding a vertex to an ultraconnected graph preserves ultraconnectivity. We also derive bounds on the number of vertices which guarantee ultraconnectivity of certain classes of regular graphs. We …

    byu Repository record for Ultraconnected and Critical Graphs (opens in a new tab) Download PDF for Ultraconnected and Critical Graphs (opens in a new tab)

  14. Covering cover pebbling number of products of paths

    … determine the covering cover pebbling number for Cartesian products of paths. The covering cover pebbling number of a graph, G, is the smallest number of pebbles, n, required such that any distribution of n pebbles onto the vertices of G can be, through a sequence of pebbling moves, redistributed …

    umn Repository record for Covering cover pebbling number of products of paths (opens in a new tab)

  15. Models for intuitionistic logic

    … of M-L obtained by dropping the rules for cartesian products of types and without rules for universes of types has proof theoretic ordinal ω<sup>ω</sup>.</p>

    oxford Repository record for Models for intuitionistic logic (opens in a new tab)

  16. Local automorphisms of finitary incidence algebras.

    … We will discuss local automorphisms of cartesian products as a special case in preparation of the general result. Finally, we will explore the automorphisms and local automorphisms of the $End_R(V),$ where $V$ is a free $R$-module and $R$ is no longer necessarily indecomposable.

    baylor Repository record for Local automorphisms of finitary incidence algebras. (opens in a new tab)

  17. Multichannel Communication and Graph Vertex Labeling Problems

    … of bandwidth optimization of Hamming graphs (Cartesian products of cliques). The graph problem has been open since the 1960s. In this thesis, we demonstrate lower bounds and a nearly optimal solution to this problem. Using techniques developed for this solution, we give an algorithm for the …

    uiuc Repository record for Multichannel Communication and Graph Vertex Labeling Problems (opens in a new tab)

  18. Variations on the power domination problem: Hypergraphs and robustness

    … the impact of edge/vertex removal, linear sums, Cartesian products, and weak coronas.</p> <p>The second variation considers how the minimum number of sensors and their placement changes when k sensors are allowed to fail. The PMU-defect robust power domination number is also a novel parameter, …

    iastate Repository record for Variations on the power domination problem: Hypergraphs and robustness (opens in a new tab)

  19. 2-limited broadcast domination on grid graphs

    … number of various grid graphs, in particular the Cartesian products of two paths, a path and a cycle, and two cycles. The upper bounds are derived by explicit broadcast constructions for these graphs. The lower bounds are obtained via linear programming duality by finding lower bounds for the …

    uvic Repository record for 2-limited broadcast domination on grid graphs (opens in a new tab)

Page 1 of 2