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 20 of 26 for “"Transitive graphs"”.
-
Imprimitive distance-transitive graphs
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2004
-
Representations of transitive graphs by automata
… collection of new results on representations of transitive graphs by automata. The results obtained in this thesis lay at the junction of group theory and formal language theory.
-
Self-Complementary Arc-Transitive Graphs and Their Imposters
… two infinite families of self-complementary arc-transitive graphs: the familiar Paley graphs and the newly discovered Peisert graphs. After studying both families, we examine a result of Peisert which proves the Paley and Peisert graphs are the only self-complementary arc transitive graphs other …
-
Quantum Walks on Arc-Transitive Graphs with Self-Loops
… cycles, n-dimensional tori, hypercubes, Johnson graphs, and other classes of vertex-transitive graphs. The results of numerical simulation show that lackadaisical quantum walks can find a unique marked vertex on these graphs with constant success probability quadratically faster than the random …
-
Vertex-transitive graphs and maps and their automorphism groups
… 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
-
Διασπάσεις ομάδων και σχεδόν ισομετρίες
… 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 vertex …
-
Distance-Regular Graphs and Generalizations
A distance-transitive graph (GAMMA) is an undirected, locally finite graph where for any vertices u,v,x,y, (PAR-DIFF)(u,v) = (PAR-DIFF)(x,y) implies (sigma)u = x and (sigma)v = y for some automorphism (sigma) of (GAMMA). Distance-transitive graphs have certain combinatorial properties, which can be …
-
Noise sensitivity and percolation beyond the classical framework
… with respect to each parameter for non-amenable graphs of bounded degrees and quasi-transitive graphs of superlinear polynomial growth. We also prove the sharpness of the phase transition for transitive graphs.
-
Discrete probability and the geometry of graphs
… other. We study these models primarily on planar graphs, on transitive graphs, and on unimodular random rooted graphs, although some of our results hold for more general classes of graphs. Broadly speaking, we are interested in the interplay between the geometry of a graph and the behaviour of …
-
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 …
-
Percolation on graphs of polynomial growth
… thesis is devoted to the study of percolation on graphs of polynomial growth. We mostly focus on Bernoulli bond percolation, introduced by Broadbent and Hammersley in [BH57] as a model for porous media. This model exhibits a phase transition phenomenon, with a subcritical phase where the …
-
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 …
-
Analysis and Optimization of Communication Networks with Flow Requirements
… of the graph into the probability that subgraphs have a certain connectivity. We also extend an approximation algorithm of Karger from the All-Terminal Unreliability to k-edge connected Unreliability and study the k-edge connected Reliability for some special graph classes, namely graphs …
-
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 …
-
Finite Hypergroups and Their Representation Theory
… coming from finite groups and distance-transitive graphs. All of these hypergroups are commutative, and therefore the entire body of results apply to them.
-
Singular graphs
… posed the problem of characterizing singular graphs. Singular graphs have important applications in mathematics and science. In chemistry the importance of singular graphs lies in the fact that a singular molecular graph, with vertices formed by atoms, edges corresponding to bonds between the …
-
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
… 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 …
Page 1 of 2