Transitivity conditions in infinite graphs

DOI10.1007/s00493-012-2694-zzbMath1299.05157arXiv0910.5651OpenAlexW1975262462MaRDI QIDQ2250834

Julian Pott, Matthias Hamann

Publication date: 21 July 2014

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.5651

zbMATH Keywords

distance transitive graph\(k\)-distance transitive graphinfinite graph of connectivity 1

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)

Related Items

Vertex Cuts ⋮ Group actions on metric spaces: fixed points and free subgroups ⋮ The classification of finite and locally finite connected-homogeneous digraphs ⋮ Sharply \(k\)-arc-transitive-digraphs: finite and infinite examples ⋮ The classification of connected-homogeneous digraphs with more than one end

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Countable connected-homogeneous graphs
• \(k\)-CS-transitive infinite graphs
• Combinatorially homogeneous graphs
• Infinite distance transitive graphs of finite valency
• Homogeneous graphs
• Distance-transitivity in infinite graphs
• Vertex-transitive graphs and accessibility
• Accessibility and ends of graphs
• Vertex Cuts
• On Homogeneous Graphs
• Metric ends, fibers and automorphisms of graphs

This page was built for publication: Transitivity conditions in infinite graphs