Diameter and connectivity of 3-arc graphs
type: Item
instance of: scholarly article
title: Diameter and connectivity of 3-arc graphs
zbMATH Open document ID: 1202.05055
author: Martin Knor
author: Sanming Zhou
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5648170
zbMATH Keywords: 3-arc graph
zbMATH Keywords: diameter
zbMATH Keywords: connectivity
zbMATH Keywords: splitting construction
zbMATH Keywords: 3-arc graph construction
MaRDI profile type: Publication
full work available at URL: j.disc.2009.07.026
OpenAlex ID: W2093989139
cites work: A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
cites work: Q4261824
cites work: Q5422499
cites work: Path graphs
cites work: CROSS RATIO GRAPHS
cites work: Q3872508
cites work: Finite symmetric graphs with two-arc transitive quotients
cites work: Q4944758
cites work: Connectivity of iterated line graphs
cites work: Q4529522
cites work: A class of finite symmetric graphs with 2-arc transitive quotients
cites work: Finite symmetric graphs with two‐arc transitive quotients II
cites work: Q4374712
cites work: Q4393241
cites work: Imprimitive symmetric graphs, 3-arc graphs and 1-designs
cites work: Constructing a class of symmetric graphs
cites work: Almost covers of 2-arc transitive graphs
DOI: 10.1016/J.DISC.2009.07.026
description: scientific article; zbMATH DE number 5648170