2

By constant link, I mean for any vertices $v,w$ of a graph $G$, the subgraph of $G$ induced by the neighborhood of $v$ is isomorphic to the subgraph induced by the neighborhood of $w$.

$C_n + C_m$ satisfies these conditions for $m \neq n$, which is the first example that I was able to come up with. But I'm finding it difficult to conceive of a connected graph with constant link which is not vertex transitive.

Is anything known on the existence or lack thereof of such graphs?

311411
  • 3,576

1 Answers1

2

Well, any triangle-free regular graph has constant link. Or take the line graph of such a graph.

Chris Godsil
  • 14,053