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 13 of 13 for “"Vertex transitive graphs"”.
-
Vertex-transitive graphs and maps and their automorphism groups
… highly symmetrical combinatorial structures - vertex transitive graphs. One of the best known examples of infinite families of vertex-transitive graphs are the Cayley graphs. Besides these, and some additional sporadic examples, not many examples have been known. Quite recently, a great deal of …
-
On certain pushing-up problems related to vertex transitive graphs
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1998
-
Διασπάσεις ομάδων και σχεδόν ισομετρίες
… divided in two parts; in the first part we study vertex transitive graphs in relation to group theory, and in the second part we study some quasi-isometry invariants of geometric group theory. Specifically, we start by examining isoperimetric inequalities and we prove rough structure theorems for …
-
Variations on a Theme: Graph Homomorphisms
… of the theory of graph homomorphisms: cores of graphs, the homomorphism order, and quantum homomorphisms. A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that, for vertex transitive graphs, the size of the core must divide the size of …
-
Graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitively and applications to tensor products
"The graphs on which dihedral, quaternion, and abelian groups act vertex and/or edge transitivity are completely characterized. The vertex transitive graphs belong to one of three families--the well known circulant graphs, the metacirculant graphs constructured by Alspach and Parsons, and a family …
-
Contributions to combinatorics on words in an abelian context and covering problems in graphs
… and on the other hand covering problems in graphs. Each particular problem is the topic of a chapter. In combinatorics on words, the first problem considered focuses on the 2-regularity of sequences in the sense of Allouche and Shallit. We prove that a sequence satisfying a certain symmetry …
-
Quantum Walks on Arc-Transitive Graphs with Self-Loops
… walk obtained by adding a self-loop to each vertex in the graph. The lackadaisical quantum walk has been studied on cycles, n-dimensional tori, hypercubes, Johnson graphs, and other classes of vertex-transitive graphs. The results of numerical simulation show that lackadaisical quantum walks …
-
Singular graphs
Let Γ be a simple graph on a finite vertex set V and let A be its adjacency matrix. Then Γ is said to be singular if and only if 0 is an eigenvalue of A. The nullity (singularity) of Γ, denoted by null(Γ), is the algebraic multiplicity of the eigenvalue 0 in the spectrum of Γ. In 1957, Collatz and …
-
Computational and Theoretical Aspects of <em>N</em>-E.C. Graphs
We consider graphs with the n-existentially closed adjacency property. For a positive integer n, a graph is n-existentially closed (or n-e.c.) if for all disjoint sets of vertices A and B with \A∪ B\ = n (one of A or B can be empty), there is a vertex 2 not in A∪B joined to each vertex of A and no …
-
Classification of Vertex-Transitive Structures
… the Borel complexities of various classes of vertex-transitive structures, or structures for which every pair or elements are equivalent under some element of its automorphism group. John Clemens has shown that the class of vertex-transitive graphs has maximum possible complexity, namely Borel …
-
Entropy and Graphs
… itself and on a probability distribution on its vertex set. This graph functional originated from the problem of source coding in information theory and was introduced by J. K\"{o}rner in 1973. Although the notion of graph entropy has its roots in information theory, it was proved to be closely …
-
Returning walks on groups with tree-like Schreier graphs
We study closed walks on an infinite family of vertex-transitive graphs which arise as Schreier coset graphs of group presentations of the form G = 〈 a₁, a₂, . . . , aₖ | a₁ᴾ¹} =· · · = aₖᴾᴷ〉 . This is done by using bivariate generating functions to keep track of the length and the winding number …
-
Hamilton decompositions of 6-regular abelian Cayley graphs
In 1969, Lovasz asked whether every connected, vertex-transitive graph has a Hamilton path. This question has generated a considerable amount of interest, yet remains vastly open. To date, there exist no known connected, vertex-transitive graph that does not possess a Hamilton path. For the Cayley …