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 35 for “"Graph Products"”.

  1. Graph products of groups

    … have continued the study of semifree, or graph groups, as they call them. They answer some of the questions left open by the work of Baudisch. It is possible to take the graph analogy a level higher and study graph products of groups, which not only generalise graph groups, but also free …

    whiterose Download PDF for Graph products of groups (opens in a new tab)

  2. Problems in Domination and Graph Products

    … 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 having a unique …

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

  3. Reliability of networks modelled by graph products

    A general purpose in Graph Theory is to describe any graph structure and provide all the information about it as possible. The study of invariants, properties and graph families of interest has been the aim of many researches in last years. There exist several classical lines of research in Graph …

    sevilla Repository record for Reliability of networks modelled by graph products (opens in a new tab)

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

  5. Weak Amenability is Stable under Graph Products

    … property known to be stable under direct products and free products. In this thesis we show that graph products of weakly amenable discrete groups are weakly amenable (with Cowling-Haagerup constant 1). Along the way we construct a wall space associated to the word length structure of a …

    hawaii Repository record for Weak Amenability is Stable under Graph Products (opens in a new tab)

  6. Monotonicity Testing for Boolean Functions over Graph Products

    … Chung and Tetali's isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions over products of general posets.

    waterloo Repository record for Monotonicity Testing for Boolean Functions over Graph Products (opens in a new tab)

  7. Independent sets in graph products via harmonic analysis

    … sets of Knr , the weak product of n complete graphs on r vertices, which are close to be of maximum size. We review the previously known results. For constant r and arbitrary n, it was known that every such independent set is close to some independent set of maximum size. We prove that this …

    concordia Download PDF for Independent sets in graph products via harmonic analysis (opens in a new tab)

  8. Hierarchical Hyperbolicity of Graph Products and Graph Braid Groups

    … variety of groups and spaces. We show that any graph product of finitely generated groups is hierarchically hyperbolic relative to its vertex groups. We apply this to answer two questions of Genevois about the electrification of a graph product of finite groups. We also answer two questions of …

    cuny-grad Repository record for Hierarchical Hyperbolicity of Graph Products and Graph Braid Groups (opens in a new tab)

  9. Solution sets of equations in infinite discrete groups

    … Rational growth and degree of commutativity of graph products, J. Algebra 522 (2019), 309{331.<br/>[2] A. Martino, M. Tointon, M. Valiunas, and E. Ventura, Probabilistic nilpotence in infinite groups, preprint, available at arXiv:1805.11520 [math.GR], 2018.<br/>[3] M. Valiunas, Acylindrical …

    soton Download PDF for Solution sets of equations in infinite discrete groups (opens in a new tab)

  10. Local Prime Factor Decomposition of Approximate Strong Product Graphs

    In practice, graphs often occur as perturbed product structures, so-called approximate graph products. The practical application of the well-known prime factorization algorithms is therefore limited, since most graphs are prime, although they can have a product-like structure. This work is …

    qucosa-diss

  11. Grid Minors and Products

    … 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 result is tight: the …

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

  12. Domination in Graphs

    … number of the Cartesian product of two graphs is at least the product of their domination numbers; this remains one of the biggest open problems in the study of domination in graphs. Several partial results have been proven, but the conjecture has yet to be proven in general. The purpose …

    usf Repository record for Domination in Graphs (opens in a new tab)

  13. Computational complexity of digraph decomposition and the congruence extension property for algebras

    … strong direct product is one of the standard graph products. In 1992, Feigenbaum and Schaffer presented a polynomial-time algorithm to find the unique prime factorization of connected graphs under the strong direct product. In this paper, we show that weakly connected directed graphs have …

    iastate Repository record for Computational complexity of digraph decomposition and the congruence extension property for algebras (opens in a new tab)

  14. Regular Dilation on Semigroups

    … the connection between regular dilation on graph products of N, which uni es Brehmer's dilation theorem and the well-known Frazho-Bunce-Popescu's dilation theorem. Finally, we consider regular dilation on right LCM semigroups and study its connection to Nica-covariant dilation.

    waterloo Repository record for Regular Dilation on Semigroups (opens in a new tab)

  15. Symmetric Product Graphs

    We describe four types of hyperspace graphs; namely, the simultaneous and nonsimultaneous symmetric product graphs, as well as their respective layers. These hyperspace graphs are meant to be analogous to the concepts of hyperspaces in topology, in that they are constructed by taking in another …

    rit Repository record for Symmetric Product Graphs (opens in a new tab)

  16. Lower Bounds and Algorithms for Searching Networks

    Research on graph searching has recently gained interest in computer science, mathematics, and physics. This thesis provides new results on two graph search models, namely fast searching and the zero-visibility cops and robber model. Given a graph that contains an invisible fugitive, the fast …

    regina Repository record for Lower Bounds and Algorithms for Searching Networks (opens in a new tab) Download PDF for Lower Bounds and Algorithms for Searching Networks (opens in a new tab)

  17. Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs

    … known for some time that connected non-bipartite graphs have unique prime factorizations over the direct product, the same cannot be said of bipartite graphs. This is somewhat vexing, as bipartite graphs do have unique prime factorizations over other graph products (the Cartesian product, for …

    vcu Repository record for Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs (opens in a new tab)

  18. On the Embeddings of the Semi-Strong Product Graph

    … lot has been written about the three more common graph products (Cartesian product, Direct product and the Strong product), as all three of these are commutative products. This thesis investigates a non-commutative product graph, H, G, we call the Semi-Strong graph product, also referred in the …

    vcu Repository record for On the Embeddings of the Semi-Strong Product Graph (opens in a new tab)

  19. The homology of groupnets

    … of (V, A) are all monomorphisms, G is known as a graph product. The principal result of the thesis is the construction of a G-complex with universal properties - the G-mapping cylinder - from a diagram of complexes corresponding to (V, A) , and the subsequent proof that if G is a graph product and …

    anu Repository record for The homology of groupnets (opens in a new tab)

Page 1 of 2