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 107 for “"cartesian product"”.

  1. Domination of a generalized Cartesian product

    … H$ denote the Cartesian product of the graphs $G$ and $H$. Domination of the Cartesian product of two graphs has received much attention, with a main objective to confirm the truth of Vizing's well-known conjecture. The conjecture states that the domination …

    uvic Repository record for Domination of a generalized Cartesian product (opens in a new tab)

  2. Second-order sub-array Cartesian product split-plot design

    … design referred to as second-order sub-array Cartesian product split-plot design. This new form of design is an alternative to ineffective split-plot designs that are currently in use by the manufacturing and quality control community. The design is economical, the prediction variance of the …

    colostate Repository record for Second-order sub-array Cartesian product split-plot design (opens in a new tab)

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

  4. Caratheodory cubature measures

    … Both are based on thinning the support of the Cartesian product cubature measure, whose cardinality grows exponentially with dimension, via a formulation of a suitable feasibility LP (Linear Programming) problem. A basic feasible solution to the latter fully characterises a Carathéodory …

    oxford Repository record for Caratheodory cubature measures (opens in a new tab)

  5. Grid Minors and Products

    Motivated by recent developments regarding the product structure of planar graphs, we study relationships between treewidth, grid minors, and graph products. We show that the Cartesian product of any two graphs, each connected and each having n vertices, contains an Ω(√n) × Ω(√n) grid minor. This …

    ottawa-retro Repository record for Grid Minors and Products (opens in a new tab)

  6. Weyl formula improvement for product of Zoll manifolds

    … to $o(\lambda^{d-1})$ in the case of product manifold by using a famous result of Duistermaat and Guillemin. They also showed that we could have polynomial improvement in the special case of Cartesian product of round spheres by reducing the problem to the study of the distribution of …

    jhu Repository record for Weyl formula improvement for product of Zoll manifolds (opens in a new tab)

  7. Problems in Domination and Graph Products

    … first consider unique minimum dominating sets in Cartesian product graphs. Our attention then turns to unique minimum independent dominating sets in trees, and in some direct product graphs. Next, we consider an extremal graph theory problem and determine the maximum number of edges in a graph …

    clemson Repository record for Problems in Domination and Graph Products (opens in a new tab)

  8. Products and Factorizations of Graphs

    It is shown that the cardinal product of graphs does not satisfy unique prime factorization even for a very restrictive class of graphs. It is also proved that every connected graph has a decomposition as a weak cartesian product into indecomposable factors and that this decomposition is unique to …

    mcmaster Repository record for Products and Factorizations of Graphs (opens in a new tab)

  9. Query Optimization for Relational Database Systems

    … develops a new algorithm for computing the Cartesian product and join of large relations which attempts to take maximum advantage of available main-memory buffer space.

    uiuc Repository record for Query Optimization for Relational Database Systems (opens in a new tab)

  10. Planar and hamiltonian cover graphs

    … of posets with planar cover graphs, and the cartesian product of posets whose cover graphs have hamiltonian cycles that parse into symmetric chains. Posets of height two can have arbitrarily large dimension. In 1981, Kelly provided an infinite sequence of planar posets that shows that the …

    gatech Repository record for Planar and hamiltonian cover graphs (opens in a new tab)

  11. Product and Function Spaces

    In this paper the Cartesian product topology for an arbitrary family of topological spaces and some of its basic properties are defined. The space is investigated to determine which of the separation properties of the component spaces are invariant.

    unt Repository record for Product and Function Spaces (opens in a new tab)

  12. Broadcasting in Hyper-cylinder graphs

    … links. In this thesis, it is observed that the Cartesian product of a number of path and cycle graphs produces a valuable set of topologies, we called hyper-cylinders, which contain hypercube and Torus as well. Any hyper-cylinder shares many of the beneficial features of hypercube and torus and …

    concordia Download PDF for Broadcasting in Hyper-cylinder graphs (opens in a new tab)

  13. Topological Operations for Genus Distributions and Embeddings of Graphs

    … to treat one graph. We then consider the Cartesian product, dot product and extended dot product which are designed to be applied between two graphs. Face-contraction, vertex-splitting, vertex-augment, pearl-making, bouquet-making and face-expansion are discussed to achieve partial genus …

    auckland-ms Repository record for Topological Operations for Genus Distributions and Embeddings of Graphs (opens in a new tab)

  14. Saturation Problems on Graphs

    … recursive formulas for m_e(G,r) when G is a Cartesian product of stars or a Cartesian product of joined cycles (cycles with a single chord). We also give upper and lower bounds on m_e(G,r) when G is a Cartesian product of a tree with any graph H, and examine the conditions under which these …

    uvic Repository record for Saturation Problems on Graphs (opens in a new tab)

  15. Identifying Codes and Domination in the Product of Graphs

    … We consider identifying codes of the direct product $K_n \times K_m$. In particular, we answer a question of Klav\v{z}ar and show the exact value of $\gid(K_n \times K_m)$. It was recently shown by Gravier, Moncel and Semri that for the Cartesian product of two same-sized cliques $\gid(K_n …

    clemson Repository record for Identifying Codes and Domination in the Product of Graphs (opens in a new tab)

  16. On Iwase's Construction of a Counterexample to Ganea's Conjecture

    … forth a conjecture that the LS category of the Cartesian product of a topological space X with a sphere Sn is always exactly 1 higher than the LS category of X by itself. Several special cases of this conjecture were proven in the years following, however the question remained open until 1998 …

    ottawa-retro Repository record for On Iwase's Construction of a Counterexample to Ganea's Conjecture (opens in a new tab)

  17. Mathematical Modelling of Novel Ultrasonic Transducers with Fractal-Like Geometries

    … designs. The structures considered are the Cartesian product of two Sierpinski gasket lattices and the Cartesian product of two Sierpinski carpet lattices. These structures are utilised to obtain the theoretical operating characteristics for novel devices.

    southwales Repository record for Mathematical Modelling of Novel Ultrasonic Transducers with Fractal-Like Geometries (opens in a new tab) Download PDF for Mathematical Modelling of Novel Ultrasonic Transducers with Fractal-Like Geometries (opens in a new tab)

  18. The Cover Time of Random Walks on Graph

    … of a pair of graphs, and the cover time of their Cartesian product. This extends previous work on special cases of the Cartesian product, in particular, the square of a graph. We show that when one of the factors is in some sense larger than the other, its cover time dominates, and can become …

    kings Repository record for The Cover Time of Random Walks on Graph (opens in a new tab) Download PDF for The Cover Time of Random Walks on Graph (opens in a new tab)

  19. Variations on Graph Products and Vertex Partitions

    In this thesis we investigate two graph products called double vertex graphs and complete double vertex graphs, and two vertex partitions called dominator partitions and rankings. We introduce a new graph product called the complete double vertex graph and study its properties. The complete double …

    clemson Repository record for Variations on Graph Products and Vertex Partitions (opens in a new tab)

  20. Kings in the Direct Product of Digraphs

    … for some k. We will look at kings in the direct product of digraphs and characterize a relationship between kings in the product and kings in the factors. This is a continuation of a project in which a similar characterization is found for the cartesian product of digraphs, the strong product of …

    vcu Repository record for Kings in the Direct Product of Digraphs (opens in a new tab)

Page 1 of 6