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 6 of 6 for “"coclique"”.
-
Spectral Aspects of Cocliques in Graphs
… considers spectral approaches to finding maximum cocliques in graphs. We focus on the relation between the eigenspaces of a graph and the size and location of its maximum cocliques. Our main result concerns the computational problem of finding the size of a maximum coclique in a graph. This …
-
Cameron-Liebler Sets for 2-Transitive Groups
… and ΓG is its derangement graph. Any maximum coclique S of ΓG has a characteristic vector xS. Each xS is a boolean vector contained in a particular module, which is called the permutation module MP. This module has a dimension of 1 + (n − 1)2, where n = deg(G), and it is spanned by {xij | …
-
PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).
… into two sets V and B such that V is a coclique and every vertex in B is adjacent to the same number of vertices in V. In this case, a balanced incomplete block design can be defined by taking elements of V as objects and elements of B as blocks. Many strongly regular graphs can be …
-
Graphs of Polytopes
… size of an anticlique (sometimes called a coclique, stable set, or independent set) of the graph of a polytope based on its dimension and number of vertices. Two results concerning properties preserved by certain operations on polytopes are presented. The first is that the Gale diagram of a …
-
Quantum independence and chromatic numbers
In this thesis we are studying the cases when quantum independence and quantum chromatic numbers coincide with or differ from their classical counterparts. Knowing about the relation of chromatic numbers separation to the projective Kochen-Specker sets, we found an analogous characterisation for …
-
On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s
<p>Denote by $k_t(G)$ the number of cliques of order $t$ in a graph $G$ having $n$ vertices. Let $k_t(n) = \min\{k_t(G)+k_t(\overline{G}) \}$ where $\overline{G}$ denotes the complement of $G$. Let $c_t(n) = {k_t(n)}/{\tbinom{n}{t}}$ and $c_t$ be the limit of $c_t(n)$ for $n$ going to infinity. A …