ON FINITE FIXED SETS IN INFINITE-GRAPHS

被引：6
|
作者：
JUNG, HA [1 ]
机构：
[1] TECH UNIV BERLIN,FACHBEREICH MATH,D-10623 BERLIN,GERMANY
来源：
DISCRETE MATHEMATICS | 1994年 / 131卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(94)90378-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An automorphism of a graph X is called a translation of X if it fixes no finite non-empty set of vertices of X. It is shown that a group G of automorphisms of the connected graph X fixes a finite non-empty set of vertices or ends of X if and only if any two translations of X in G have a common fixed end. Applications and refinements are discussed.
引用
收藏
页码：115 / 125
页数：11
相关论文
共 50 条
12345