A graph \(\Gamma\) is called homogenous if the group of automorphisms of \(\Gamma\) acts transitively on the set of vertices of \(\Gamma\). We will study the following properties for homogenous graphs:

Removability: a vertex p is removable if the graph obtained by removing it is isomorphic to the original.

Property (R): for every edge x there exists an edge y such that removing x and y disconnects the graph.

We will study also Cayley graphs of groups of automorphisms of graphs with the property (R) and related concepts.

中文翻译：

---

在一些带有两个可移动顶点的2边连接齐性图和Cayley图上

的曲线图\（\伽玛\）如果该组的构被称为同质\（\伽玛\）传递地作用在该组顶点的\（\伽玛\） 。我们将研究同构图的以下属性：

可除去性，即顶点p是可移除的，如果通过除去它而获得的图形是同构的原稿。

属性（R）：对于每个边x，都存在一个边y，以便删除x 和y可以断开图形。

我们还将研究具有属性（R）和相关概念的图的自同构群的Cayley图。