AbstractIn this paper we give an overview on connected locally finite transitive graphs with polynomial growth. We present results concerning the following topics: •Automorphism groups of graphs with polynomial growth.•Groups and graphs with linear growth.•S-transitivity.•Covering graphs.•Automorphism groups as topological groups
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
AbstractIn the first part of this paper we consider nilpotent groups G acting with finitely many orb...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
AbstractIn the first part of this paper we consider nilpotent groups G acting with finitely many orb...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
AbstractLet X be a locally finite, vertex-transitive, infinite graph with polynomial growth. Then th...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractWe apply the theory of covering spaces to show how one can construct infinitely many finite ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
The thesis explores the concept of growth in graphs and some similar concepts, such as the distance ...
Let X be a locally finite, vertex-transitive, infinite graph with polynomial growth. Then there exis...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
AbstractIn the first part of this paper we consider nilpotent groups G acting with finitely many orb...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
AbstractIn the first part of this paper we consider nilpotent groups G acting with finitely many orb...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
AbstractLet X be a locally finite, vertex-transitive, infinite graph with polynomial growth. Then th...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractWe apply the theory of covering spaces to show how one can construct infinitely many finite ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
The thesis explores the concept of growth in graphs and some similar concepts, such as the distance ...
Let X be a locally finite, vertex-transitive, infinite graph with polynomial growth. Then there exis...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
DOI
Add to ORKG