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 9 of 9 for “"kneser graphs"”.
-
Dominating sets in Kneser graphs
This thesis investigates dominating sets in Kneser graphs as well as a selection of other topics related to graph domination. Dominating sets in Kneser graphs, especially those of minimum size, often correspond to interesting combinatorial incidence structures. We begin with background on the …
-
Graph Homomorphisms and Vector Colorings
… the highly symmetric class of 1-walk regular graphs, characterizing when such graphs admit unique vector colorings. We present this characterization, as well as several important consequences discussed in [5, 6]. By appealing to this characterization, several important families of graphs, …
-
The Graphs of HU+00E4ggkvist & Hell
This thesis investigates HU+00E4ggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with them. A variety of original results on many different properties of these graphs are given. We begin with an examination of the transitivity and …
-
Sobre coloração total de grafos Kneser e de grafos produto direto de completos e de ciclos
… the total chromatic number in three classes of graphs is studied: Kneser graphs, direct product of complete graphs and direct product of cycle graphs. In the class of Kneser graphs K(n, s), we show that the most sparse connected K(2k − 1, k − 1), known as Odd Graphs, are Type 1 and we prove that …
-
Investigations in the semi-strong product of graphs and bootstrap percolation
The semi-strong product of graphs G and H is a way of forming a new graph from the graphs G and H. The vertex set of the semi-strong product is the Cartesian product of the vertex sets of G and H, V(G) x V(H). The edges of the semi-strong product are determined as follows: (g1,h1)(g2,h2) is an edge …
-
Selecting pairs of non-transitive dice
… and discuss some theoretical aspects by use of Kneser graphs.</p>
-
Hamiltonian cycles in subset and subspace graphs.
… and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark and …
-
The Koszul dual to n-Lie, n-Com algebras, and Young tableaux
… which arise from the eigenspaces of the general Kneser graphs $\cO_{n,s}$, where the operads $n\text{-}Lie$ ($n\text{-}Com)$ and $Lie_n^d$ ($Com_n^d)$ appear on different sides of the spectrum based on the parameter $s$. With the introduction of the new class of $n$-Com algebras through the …
-
Topics In Probabilistic Combinatorics
… Stirling numbers. Chapter 5 introduces the Kneser Graph. The exact expected value and variance of the distance between [n] and a vertex chosen uniformly at random is given. An asymptotic formula for the expectation is found.