What finite Graphs $G$ have the property that for all $v,w\in G$, there is exactly one automorphism $\phi$ of $G$ with $\phi(v)=w$? Of course, each of the three graphs with one or two vertices have this property, but are there any other examples?
2026-04-04 08:41:22.1775292082
Graph with sharply 1-transitive automorphism group
120 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in GROUP-THEORY
- What is the intersection of the vertices of a face of a simplicial complex?
- Group with order $pq$ has subgroups of order $p$ and $q$
- How to construct a group whose "size" grows between polynomially and exponentially.
- Conjugacy class formula
- $G$ abelian when $Z(G)$ is a proper subset of $G$?
- A group of order 189 is not simple
- Minimal dimension needed for linearization of group action
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
- subgroups that contain a normal subgroup is also normal
- Could anyone give an **example** that a problem that can be solved by creating a new group?
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in GROUP-ACTIONS
- Orbit counting lemma hexagon
- Showing a group G acts on itself by right multiplication
- $N\trianglelefteq G$, $A$ a conjugacy class in $G$ such that $A\subseteq N$, prove $A$ is a union of conjugacy classes
- Show that the additive group $\mathbb{Z}$ acts on itself by $xy = x+y$ and find all $x\in\mathbb{Z}$ such that $xy = y$ for all $y\in\mathbb{Z}$.
- Number of different k-coloring of an $n\times m$ grid up to rows and columns permutations
- How to embed $F_q^\times $ in $S_n$?
- orbit representatives for the group of unipotent matrix acting on the set of skew-symmetric matrices
- $S_n$ right-action on $V^{\otimes n}$
- Interpretation of wreath products in general and on symmetric groups
- Regarding action of a group factoring through
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
If a graph has the property stated it is a graphical regular representation (abbreviated GRR) of its automorphism group. No characterization of these graphs is known, or at least none that is simpler than the definition. Note that any such graph is necessarily a Cayley graph for its automorphism group (as was first observed by Sabidussi.) The question has been studied is, given a group $\Gamma$, is there a Cayley graph $G$ for $\Gamma$ such that $\Gamma$ is the full automorphism group. To cut a long story very short, if $\Gamma$ has order at least 32 and is neither abelian with exponent greater than two nor generalized dicyclic, it does admit GRR. (Google for generalized dicyclic, the key property is that the "bad" groups admit a non-identity automorphism that fixes or inverts each element of $\Gamma$.)
In practice, if a group is big and not bad, most Cayley graphs for it are GRRs.
If $G$ is the Cayley graph for $\Gamma$ with connection set $C$ and there is a non-identity automorphism $\psi$ of $\Gamma$ that fixes $C$ as a set, then the automorphism group of $G$ is not regular. (This not hard to prove.) There are classes of groups for which the converse is true, e.g., $\mathbb{Z}_2^d$, and so these groups can be used to find actual examples.