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 4 of 4 for “"vertex-transitive graphs"”.
-
Strong simplicity of groups and vertex - transitive graphs
In the course of exploring various symmetries of vertex-transitive graphs, we introduce the concept of quasi-normal subgroups in groups. This is done since the symmetries of vertex-transitive graphs are intimately linked to those, fait accompli, of groups. With this, we ask if the concept 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 …
-
Phase transition for cutoff for random walks on random graphs
… properties of a simple random walk on it. Every vertex has a given number of internal, degint ≥ 3, and outgoing, degout, half-edges. Given a stochastic matrix Q, we pick a random perfect matching of the half-edges subject to the constraint that each vertex v has degint(v) neighbours inside its …
-
Codes, graphs and designs related to iterated line graphs of complete graphs
… obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1,2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+l(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn' and …