2011
DOI: 10.1007/s00373-011-1085-3
|View full text |Cite
|
Sign up to set email alerts
|

A Classification of Graphs Whose Subdivision Graph is Locally Distance Transitive

Abstract: The subdivision graph S(Σ) of a connected graph Σ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs Σ such that S(Σ) is locally (G, s)-distance transitive for s ≤ 2 diam(Σ) − 1 and some G ≤ Aut(Σ). In this paper, we solve the remaining cases by classifying all the graphs Σ such that the subdivision graphs is locally (G, s)-distance transitive for s ≥ 2 diam(Σ) and some G ≤ Aut(Σ). In particular, their subdivision graph … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…(b) Suppose Σ is in the list of Remark 1.10(c). For each of these graphs, suitable groups G are specified in [3], for which Γ is locally (G, diam(Γ))-distance transitive.…”
Section: Graphs In Theorem 14: Intersection Arraysmentioning
confidence: 99%
See 3 more Smart Citations
“…(b) Suppose Σ is in the list of Remark 1.10(c). For each of these graphs, suitable groups G are specified in [3], for which Γ is locally (G, diam(Γ))-distance transitive.…”
Section: Graphs In Theorem 14: Intersection Arraysmentioning
confidence: 99%
“…Recall that the subdivision graph S(Σ) of a graph Σ is the bipartite graph with ordered bipartition (EΣ|V Σ) and adjacency given by containment. For each of these graphs, suitable groups G are specified in [3], for which Γ is locally (G, diam(Γ))-distance transitive.…”
Section: Links Between Designs and Graphs: The Affine Casementioning
confidence: 99%
See 2 more Smart Citations