3
votes
2answers
336 views

A structure of the group of automorphisms of an infinite binary tree

My friend asked me to ask his question here. Where he can find (a paper or a book) containing a complete description (with the proof) of a structure of the group of automorphisms of an infinite binary ...
2
votes
0answers
91 views

Groups of automorphisms of weighted graphs

Let $\Gamma=(V,E,\omega)$ be an (edge-)weighted graph without loops and multiple edges. Here $V$ is the set of vertices, $E$ is the set of edges and $\omega:E \to \mathbb{N}$. A permutation $\varphi$ ...
14
votes
0answers
240 views

Maximum automorphism group for a 3-connected cubic graph

The following arose as a side issue in a project on graph reconstruction. Problem: Let $a(n)$ be the greatest order of the automorphism group of a 3-connected cubic graph with $n$ vertices. Find a ...
22
votes
2answers
1k views

Does this poset have a unique minimal element?

Recently I have been thinking about the following poset: the underlying set is $\mathcal{AFT}$ consisting of all (finite) automorphism-free undirected trees (with at least one edge to exclude the ...
0
votes
2answers
273 views

Confused about orbits

I am trying to apply the main theorem of this paper to a certain kind of graph and keep getting confused. The theorem uses $rank(Aut\Gamma)$ which is defined as "the number of $Aut \Gamma$ orbits on ...
3
votes
5answers
733 views

Is every distance-regular graph vertex-transitive?

Is every distance-regular graph vertex-transitive?
7
votes
1answer
310 views

Maximal subgroups of a certain finite 2-group

The following came up in a problem on reconstruction of digraphs. I determined enough about the answer to satisfy the application completely, but still I am curious to know what the complete solution ...
4
votes
2answers
440 views

Groups as automorphism groups of small graphs and the number of rigid graphs of a given size

In a recent question of mine I asked whether every infinite group is (isomorphic to) the automorphism group of a graph. The finite case was done by Frucht in 1939. The first answer to this ...
11
votes
2answers
1k views

Realizing groups as automorphism groups of graphs.

Frucht showed that every finite group is the automorphism group of a finite graph. The paper is here. The argument basically is that a group is the automorphism group of its (colored) Cayley graph ...