Infinite distance transitive graphs of finite valency

DOI10.1007/BF02579282zbMath0492.05036OpenAlexW2024167831WikidataQ61848402 ScholiaQ61848402MaRDI QIDQ1167738

H. D. Macpherson

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579282

zbMATH Keywords

distance transitive graphends of graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (30)

Positivity of Gibbs states on distance-regular graphs ⋮ Ends of semigroups ⋮ Ends of graphs ⋮ Connected-Homomorphism-Homogeneous Graphs ⋮ Descendant-homogeneous digraphs ⋮ Group actions on metric spaces: fixed points and free subgroups ⋮ Locally finite homogeneous graphs ⋮ The classification of finite and locally finite connected-homogeneous digraphs ⋮ On the resolution of the sensitivity conjecture ⋮ REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS ⋮ CONTINUOUS ASSOCIATION SCHEMES AND HYPERGROUPS ⋮ On the Fourier transformation of positive, positive definite measures on commutative hypergroups, and dual convolution structures ⋮ Quantifier-eliminable locally finite graphs ⋮ The classification of connected-homogeneous digraphs with more than one end ⋮ Transitivity conditions in infinite graphs ⋮ Countable connected-homogeneous graphs ⋮ Buildings and Hecke algebras. ⋮ Locally-finite connected-homogeneous digraphs ⋮ \(k\)-CS-transitive infinite graphs ⋮ Central limit theorems for random walks on \({\mathbb{N}}_ 0\) that are associated with orthogonal polynomials ⋮ Root systems and the Johnson and Hamming graphs ⋮ Metrically homogeneous graphs of diameter 3 ⋮ Cutting up graphs ⋮ Distance-transitive digraphs: descendant-homogeneity, property \(Z\) and reachability ⋮ There are only finitely many finite distance-transitive graphs of given valency greater than two ⋮ Distance-regular graphs and (s,c,a,k)-graphs ⋮ A census of infinite distance-transitive graphs ⋮ On the rate of convergence of the laws of Markov chains associated with orthogonal polynomials ⋮ Distance-transitive graphs and generalized polygons ⋮ A product formula for orthogonal polynomials associated with infinite distance-transitive graphs

Cites Work

• Cutting up graphs
• Unnamed Item

This page was built for publication: Infinite distance transitive graphs of finite valency