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 条

[21] DEGREE SEQUENCES OF INFINITE-GRAPHS
BLASS, A
HARARY, F
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1981, 23 (FEB): : 10 - 16
[22] DOMINATION GAMES ON INFINITE-GRAPHS
DIESTEL, R
LEADER, I
THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 337 - 345
[23] TRACEABLE SUBGRAPHS OF INFINITE-GRAPHS
POLAT, N
DISCRETE MATHEMATICS, 1982, 38 (2-3) : 243 - 263
[24] THE COMPLEXITY OF A CLASS OF INFINITE-GRAPHS
KOMJATH, P
PACH, J
COMBINATORICA, 1994, 14 (01) : 121 - 125
[25] HAMILTONIAN PATHS IN INFINITE-GRAPHS
HAREL, D
ISRAEL JOURNAL OF MATHEMATICS, 1991, 76 (03) : 317 - 336
[26] THE ULAM NUMBER OF INFINITE-GRAPHS
CHILAKAMARRI, KB
DEAN, N
GRAPHS AND COMBINATORICS, 1995, 11 (02) : 109 - 120
[27] WHITNEY THEOREM FOR INFINITE-GRAPHS
BEDNAREK, AR
DISCRETE MATHEMATICS, 1985, 56 (01) : 83 - 85
[28] ON THE HADWIGER NUMBER OF INFINITE-GRAPHS
SEIFTER, N
ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 1992, 62 : 207 - 215
[29] Finite invariant sets in infinite graphs
Polat, N
DISCRETE MATHEMATICS, 1996, 158 (1-3) : 211 - 221
[30] Finite invariant sets in infinite graphs
I.A.E, Univ. Jean Moulin , 15, quai Claude Bernard, 69239 Lyon Cedex 2, France
Discrete Math, 1-3 (211-221):

← 1 2 3 4 5 →