Spelling suggestions: "subject:"graph products"" "subject:"raph products""
1 |
Italian Domination on Ladders and Related ProductsGardner, Bradley 01 December 2018 (has links)
An Italian dominating function on a graph $G = (V,E)$ is a function such that $f : V \to \{0,1,2\}$, and for each vertex $v \in V$ for which $f(v) = 0$, we have $\sum_{u\in N(v)}f(u) \geq 2$. The weight of an Italian dominating function is $f(V) = \sum_{v\in V(G)}f(v)$. The minimum weight of all such functions on a graph $G$ is called the Italian domination number of $G$. In this thesis, we will consider Italian domination in various types of products of a graph $G$ with the complete graph $K_2$. We will find the value of the Italian domination number for ladders, specific families of prisms, mobius ladders and related products including categorical products $G\times K_2$ and lexicographic products $G\cdot K_2$. Finally, we will conclude with open problems.
|
2 |
Automorphism Groups of Buildings Constructed Via Covering SpacesGibbins, Aliska L. 17 September 2013 (has links)
No description available.
|
3 |
Hypergraph ProductsGringmann, Lydia 20 October 2017 (has links)
In this work, new definitions of hypergraph products are presented. The main focus is on the generalization of the commutative standard graph products: the Cartesian, the direct and the strong graph product. We will generalize these well-known graph products to products of hypergraphs and show several properties like associativity, commutativity and distributivity w.r.t. the disjoint union of hypergraphs. Moreover, we show that all defined products of simple (hyper)graphs result in a simple (hyper)graph. We will see, for what kind of product the projections into the factors are (at least weak) homomorphisms and for which products there are similar connections between the hypergraph products as there are for graphs. Last, we give a new and more constructive proof for the uniqueness of prime factorization w.r.t. the Cartesian product than in [Studia Sci. Math. Hungar. 2: 285–290 (1967)] and moreover, a product relation according to such a decomposition. That might help to find efficient algorithms for the decomposition of hypergraphs w.r.t. the Cartesian product.
|
4 |
Domination Numbers of Semi-strong Products of GraphsCheney, Stephen R 01 January 2015 (has links)
This thesis examines the domination number of the semi-strong product of two graphs G and H where both G and H are simple and connected graphs. The product has an edge set that is the union of the edge set of the direct product of G and H together with the cardinality of V(H), copies of G. Unlike the other more common products (Cartesian, direct and strong), the semi-strong product is neither commutative nor associative.
The semi-strong product is not supermultiplicative, so it does not satisfy a Vizing like conjecture. It is also not submultiplicative so it shares these two properties with the direct product.
After giving the basic definitions related with graphs, domination in graphs and basic
properties of the semi-strong product, this paper includes a general upper bound for the
domination of the semi-strong product of any two graphs G and H as less than or equal to twice the domination numbers of each graph individually. Similar general results for the semi-strong product perfect-paired domination numbers of any two graphs G and H, as well as semi-strong products of some specific types of cycle graphs are also addressed.
|
5 |
(Relaxed) Product Structures of Graphs and HypergraphsOstermeier, Lydia 20 May 2015 (has links) (PDF)
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures.
In the class of graphs, we discuss in detail \\emph{RSP-relations}, a relaxation of relations fulfilling the square property and therefore of the product relation $\\sigma$, that identifies the copies of the prime factors of a graph w.r.t. the Cartesian product. For $K_{2,3}$-free graphs finest RSP-relations can be computed in polynomial-time. In general, however, they are not unique and their number may even grow exponentially. Explicit constructions of such relations in complete and complete bipartite graphs are given.
Furthermore, we establish the close connection of (\\emph{well-behaved}) RSP-relations to \\mbox{(quasi-)covers} of graphs and equitable partitions. Thereby, we characterize the existence of non-trivial RSP-relations by means of the existence of spanning subgraphs that yield quasi-covers of the graph under investigation.
We show, how equitable partitions on the vertex set of a graph $G$ arise in a natural way from well-behaved RSP-relations on $E(G)$.
These partitions in turn give rise to quotient graphs that have rich product structure even if $G$ itself is prime. This product structure of the quotient graph is still retained even for RSP-relations that are not well-behaved. Furthermore, we will see that a (finest) RSP-relation of a product graph can be obtained easily from (finest) RSP-relations on the prime factors w.r.t. certain products and in what manner the quotient graphs of the product w.r.t. such an RSP-relation result from the quotient graphs of the factors and the respective product.
In addition, we examine relations on the edge sets of \\emph{hyper}graphs that satisfy the grid property, the hypergraph analog of the square property. We introduce the \\emph{strong} and the \\emph{relaxed} grid property as variations of the grid property, the latter generalizing the relaxed square property. We thereby show, that many, although not all results for graphs and the (relaxed) square property can be transferred to hypergraphs. Similar to the graph case,
any equivalence relation $R$ on the edge set of a hypergraph $H$ that satisfies the relaxed grid property induces a partition of the vertex set of $H$ which in turn determines quotient hypergraphs that have non-trivial product structures. Besides, we introduce the notion of \\emph{(Cartesian) hypergraph bundles}, the analog of (Cartesian) graph bundles and point out the connection between the grid property and hypergraph bundles.
Finally, we show that every connected thin hypergraph $H$ has a unique prime factorization with respect to the normal and strong (hypergraph) product. Both products coincide with the usual strong \\emph{graph} product whenever $H$ is a graph. We introduce the notion of the Cartesian skeleton of hypergraphs as a natural generalization of the Cartesian skeleton of graphs and prove that it is uniquely defined for thin hypergraphs. Moreover, we show that the Cartesian skeleton of thin hypergraphs and its PFD w.r.t. the strong and the normal product can be computed in polynomial time.
|
6 |
O número envoltório P3 e o número envoltório geodético em produtos de grafos / The P3-hull number and the geodetic hull number in graph productsNascimento, Julliano Rosa 30 November 2016 (has links)
Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2016-12-09T16:43:52Z
No. of bitstreams: 2
Dissertação - Julliano Rosa Nascimento - 2016.pdf: 1812313 bytes, checksum: 9bdaa6ddbbe1dd9ce1e9ccdea8016eaf (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2016-12-13T19:11:50Z (GMT) No. of bitstreams: 2
Dissertação - Julliano Rosa Nascimento - 2016.pdf: 1812313 bytes, checksum: 9bdaa6ddbbe1dd9ce1e9ccdea8016eaf (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2016-12-13T19:11:50Z (GMT). No. of bitstreams: 2
Dissertação - Julliano Rosa Nascimento - 2016.pdf: 1812313 bytes, checksum: 9bdaa6ddbbe1dd9ce1e9ccdea8016eaf (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Previous issue date: 2016-11-30 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work, we consider the parameter hull number in two graph convexities, the P3-
convexity and the geodetic convexity. In the P3-convexity, we present results on the P3-
hull number on the Cartesian product, strong product and lexicographic product of graphs.
In special, regarding to the Cartesian product, we proved a complexity result, in which we
show, given a graph G resulting of a Cartesian product of two graphs and a positive integer
k, is NP-complete to decide whether the P3-hull number of G is less than or equal k. We
also consider the P3-hull number on complementary prisms GG of connected graphs G
and G, in which we show a tighter upper bound than that found in the literature. In the
geodetic convexity, we show results of the hull number on complementary prisms GG
when G is a tree, when G is a disconnected graph and when G is a cograph. Finally, we
also show that in the geodetic convexity, the hull number on the complementary prism
GG is unlimited on connected graphs G and G, unlike what happens in the P3-convexity / Nesta dissertação, consideramos o parâmetro número envoltório em duas convexidades
em grafos, a convexidade P3 e a convexidade geodética. Na convexidade P3, obtivemos
resultados do número envoltório P3 para o produto Cartesiano, produto forte e produto
lexicográfico de grafos. Em especial, em relação ao produto Cartesiano, obtivemos um
resultado de complexidade, no qual mostramos que, dado um grafo G, resultante de um
produto Cartesiano de dois grafos e um inteiro positivo k, é NP-completo decidir se
o número envoltório P3 de G é menor ou igual a k. Também consideramos o número
envoltório P3 para prismas complementares GG de grafos G e G conexos, em que
mostramos um limite superior um pouco mais justo do que o encontrado na literatura.
Na convexidade geodética, mostramos resultados do número envoltório para prismas
complementares GG quando G é uma árvore, quando G é um grafo desconexo e quando
G é um cografo. Por fim, também mostramos que na convexidade geodética o número
envoltório do prisma complementar GG pode ser ilimitado para grafos G e G ambos
conexos, diferentemente do que ocorre na convexidade P3.
|
7 |
(Relaxed) Product Structures of Graphs and HypergraphsOstermeier, Lydia 13 May 2015 (has links)
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures.
In the class of graphs, we discuss in detail \\emph{RSP-relations}, a relaxation of relations fulfilling the square property and therefore of the product relation $\\sigma$, that identifies the copies of the prime factors of a graph w.r.t. the Cartesian product. For $K_{2,3}$-free graphs finest RSP-relations can be computed in polynomial-time. In general, however, they are not unique and their number may even grow exponentially. Explicit constructions of such relations in complete and complete bipartite graphs are given.
Furthermore, we establish the close connection of (\\emph{well-behaved}) RSP-relations to \\mbox{(quasi-)covers} of graphs and equitable partitions. Thereby, we characterize the existence of non-trivial RSP-relations by means of the existence of spanning subgraphs that yield quasi-covers of the graph under investigation.
We show, how equitable partitions on the vertex set of a graph $G$ arise in a natural way from well-behaved RSP-relations on $E(G)$.
These partitions in turn give rise to quotient graphs that have rich product structure even if $G$ itself is prime. This product structure of the quotient graph is still retained even for RSP-relations that are not well-behaved. Furthermore, we will see that a (finest) RSP-relation of a product graph can be obtained easily from (finest) RSP-relations on the prime factors w.r.t. certain products and in what manner the quotient graphs of the product w.r.t. such an RSP-relation result from the quotient graphs of the factors and the respective product.
In addition, we examine relations on the edge sets of \\emph{hyper}graphs that satisfy the grid property, the hypergraph analog of the square property. We introduce the \\emph{strong} and the \\emph{relaxed} grid property as variations of the grid property, the latter generalizing the relaxed square property. We thereby show, that many, although not all results for graphs and the (relaxed) square property can be transferred to hypergraphs. Similar to the graph case,
any equivalence relation $R$ on the edge set of a hypergraph $H$ that satisfies the relaxed grid property induces a partition of the vertex set of $H$ which in turn determines quotient hypergraphs that have non-trivial product structures. Besides, we introduce the notion of \\emph{(Cartesian) hypergraph bundles}, the analog of (Cartesian) graph bundles and point out the connection between the grid property and hypergraph bundles.
Finally, we show that every connected thin hypergraph $H$ has a unique prime factorization with respect to the normal and strong (hypergraph) product. Both products coincide with the usual strong \\emph{graph} product whenever $H$ is a graph. We introduce the notion of the Cartesian skeleton of hypergraphs as a natural generalization of the Cartesian skeleton of graphs and prove that it is uniquely defined for thin hypergraphs. Moreover, we show that the Cartesian skeleton of thin hypergraphs and its PFD w.r.t. the strong and the normal product can be computed in polynomial time.
|
8 |
Compressed Decision Problems in Groups / Komprimierte Entscheidungsprobleme in GruppenHaubold, Niko 19 March 2012 (has links) (PDF)
Wir beschäftigen uns mit Problemen der algorithmischen Gruppentheorie und untersuchen dabei die Komplexität von komprimierten Versionen des Wortproblems und des Konjugationsproblems für endlich erzeugte Gruppen.
Das Wortproblem fragt für eine feste, endlich erzeugte Gruppe ob ein gegebenes Wort über der Erzeugermenge das neutrale Element der Gruppe repräsentiert. Wir betrachten das gegebene Wort jedoch in einer komprimierten Form, als Straight-line Program (SLP) und untersuchen die Komplexität dieses Problems, das wir \'komprimiertes Wortproblem\' nennen. SLPs sind kontextfreie Grammatiken, die genau einen String erzeugen. Die Eingabegröße ist dabei stets die Größe des gegebenen SLPs. Eine Hauptmotivation ist dabei, dass für eine feste endlich erzeugte Gruppe das Wortproblem ihrer Automorphismengruppe durch eine Turingmaschine in Polynomialzeit auf das komprimierte Wortproblem der Gruppe selbst reduzierbar ist.
Wir untersuchen das komprimierte Wortproblem für die verbreiteten Gruppenerweiterungen HNN-Erweiterungen (amalgamierte Produkte und Graphprodukte) und können zeigen, dass sich Instanzen des komprimierten Wortproblems von einer Turingmaschine in Polynomialzeit auf Instanzen des komprimierten Wortproblems der Basisgruppe (respektive Basisgruppen und Knotengruppen) reduzieren lassen. Weiterhin zeigen wir, dass das komprimierte Wortproblem für endlich erzeugte nilpotente Gruppen von einer Turingmaschine in Polynomialzeit entscheidbar ist.
Wir betrachten außerdem eine komprimierte Variante des Konjugationsproblems. Das unkomprimierte Konjugationsproblem fragt für zwei gegebene Wörter über den Erzeugern einer festen endlich erzeugten Gruppe, ob sie in dieser Gruppe konjugiert sind. Beim komprimierten Konjugationsproblem besteht die Eingabe aus zwei SLPs und es wird gefragt, ob die beiden Wörter die von den SLPs erzeugt werden in der Gruppe konjugierte Elemente präsentieren. Wir konnten zeigen, dass sich das komprimierte Konjugationsproblem für Graphgruppen in Polynomialzeit entscheiden lässt.
Weiterhin haben wir das Wortproblem der äußeren Automorphismengruppen von Graphprodukten endlich erzeugter Gruppen untersucht. Durch den engen Zusammenhang des komprimierten Konjugationsproblems einer Gruppe mit dem Wortproblem der äußeren Automorphismengruppe konnten wir zeigen, dass sich das Wortproblem der äußeren Automorphismengruppe eines Graphprodukts von endlich erzeugten Gruppen durch eine Turingmaschine in Polynomialzeit auf Instanzen von simultanen komprimierten Konjugationsproblemen der Knotengruppen und Instanzen von komprimierten Wortproblemen der Knotengruppen reduzieren lässt.
Als Anwendung gelten obige Resultate auch für right-angled Coxetergruppen und Graphgruppen, da beide spezielle Graphprodukte sind. So folgt beispielsweise, dass das komprimierte Wortproblem einer right-angled Coxetergruppe in Polynomialzeit entscheidbar ist.
|
9 |
Cubical-like geometry of quasi-median graphs and applications to geometric group theory / Géométrie cubique des graphes quasi-médians et applications à la théorie géométrique des groupesGenevois, Anthony 01 December 2017 (has links)
La classe des graphes quasi-médians est une généralisation des graphes médians, ou de manière équivalente, des complexes cubiques CAT(0). L'objectif de cette thèse est d'introduire ces graphes dans le monde de la théorie géométrique des groupes. Dans un premier temps, nous étendons la notion d'hyperplan définie dans les complexes cubiques CAT(0), et nous montrons que la géométrie d'un graphe quasi-médian se réduit essentiellement à la combinatoire de ses hyperplans. Dans la deuxième partie de notre texte, qui est le cœur de la thèse, nous exploitons la structure particulière des hyperplans pour démontrer des résultats de combinaison. L'idée principale est que si un groupe agit d'une bonne manière sur un graphe quasi-médian de sorte que les stabilisateurs de cliques satisfont une certaine propriété P de courbure négative ou nulle, alors le groupe tout entier doit satisfaire P également. Les propriétés que nous considérons incluent : l'hyperbolicité (éventuellement relative), les compressions lp (équivariantes), la géométrie CAT(0) et la géométrie cubique. Finalement, la troisième et dernière partie de la thèse est consacrée à l'application des critères généraux démontrés précédemment à certaines classes de groupes particulières, incluant les produits graphés, les groupes de diagrammes introduits par Guba et Sapir, certains produits en couronne, et certains graphes de groupes. Les produits graphés constituent notre application la plus naturelle, où le lien entre le groupe et son graphe quasi-médian associé est particulièrement fort et explicite; en particulier, nous sommes capables de déterminer précisément quand un produit graphé est relativement hyperbolique. / The class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the definition of hyperplanes from CAT(0) cube complexes, and we show that the geometry of a quasi-median graph essentially reduces to the combinatorics of its hyperplanes. In the second part, we exploit the specific structure of the hyperplanes to state combination results. The main idea is that if a group acts in a suitable way on a quasi-median graph so that clique-stabilisers satisfy some non-positively curved property P, then the whole group must satisfy P as well. The properties we are interested in are mainly (relative) hyperbolicity, (equivariant) lp-compressions, CAT(0)-ness and cubicality. In the third part, we apply our general criteria to several classes of groups, including graph products, Guba and Sapir's diagram products, some wreath products, and some graphs of groups. Graph products are our most natural examples, where the link between the group and its quasi-median graph is particularly strong and explicit; in particular, we are able to determine precisely when a graph product is relatively hyperbolic.
|
10 |
Compressed Decision Problems in GroupsHaubold, Niko 02 January 2012 (has links)
Wir beschäftigen uns mit Problemen der algorithmischen Gruppentheorie und untersuchen dabei die Komplexität von komprimierten Versionen des Wortproblems und des Konjugationsproblems für endlich erzeugte Gruppen.
Das Wortproblem fragt für eine feste, endlich erzeugte Gruppe ob ein gegebenes Wort über der Erzeugermenge das neutrale Element der Gruppe repräsentiert. Wir betrachten das gegebene Wort jedoch in einer komprimierten Form, als Straight-line Program (SLP) und untersuchen die Komplexität dieses Problems, das wir \''komprimiertes Wortproblem\'' nennen. SLPs sind kontextfreie Grammatiken, die genau einen String erzeugen. Die Eingabegröße ist dabei stets die Größe des gegebenen SLPs. Eine Hauptmotivation ist dabei, dass für eine feste endlich erzeugte Gruppe das Wortproblem ihrer Automorphismengruppe durch eine Turingmaschine in Polynomialzeit auf das komprimierte Wortproblem der Gruppe selbst reduzierbar ist.
Wir untersuchen das komprimierte Wortproblem für die verbreiteten Gruppenerweiterungen HNN-Erweiterungen (amalgamierte Produkte und Graphprodukte) und können zeigen, dass sich Instanzen des komprimierten Wortproblems von einer Turingmaschine in Polynomialzeit auf Instanzen des komprimierten Wortproblems der Basisgruppe (respektive Basisgruppen und Knotengruppen) reduzieren lassen. Weiterhin zeigen wir, dass das komprimierte Wortproblem für endlich erzeugte nilpotente Gruppen von einer Turingmaschine in Polynomialzeit entscheidbar ist.
Wir betrachten außerdem eine komprimierte Variante des Konjugationsproblems. Das unkomprimierte Konjugationsproblem fragt für zwei gegebene Wörter über den Erzeugern einer festen endlich erzeugten Gruppe, ob sie in dieser Gruppe konjugiert sind. Beim komprimierten Konjugationsproblem besteht die Eingabe aus zwei SLPs und es wird gefragt, ob die beiden Wörter die von den SLPs erzeugt werden in der Gruppe konjugierte Elemente präsentieren. Wir konnten zeigen, dass sich das komprimierte Konjugationsproblem für Graphgruppen in Polynomialzeit entscheiden lässt.
Weiterhin haben wir das Wortproblem der äußeren Automorphismengruppen von Graphprodukten endlich erzeugter Gruppen untersucht. Durch den engen Zusammenhang des komprimierten Konjugationsproblems einer Gruppe mit dem Wortproblem der äußeren Automorphismengruppe konnten wir zeigen, dass sich das Wortproblem der äußeren Automorphismengruppe eines Graphprodukts von endlich erzeugten Gruppen durch eine Turingmaschine in Polynomialzeit auf Instanzen von simultanen komprimierten Konjugationsproblemen der Knotengruppen und Instanzen von komprimierten Wortproblemen der Knotengruppen reduzieren lässt.
Als Anwendung gelten obige Resultate auch für right-angled Coxetergruppen und Graphgruppen, da beide spezielle Graphprodukte sind. So folgt beispielsweise, dass das komprimierte Wortproblem einer right-angled Coxetergruppe in Polynomialzeit entscheidbar ist.
|
Page generated in 0.0759 seconds