Bounding the Valency of Polygonal Graphs With Odd Girth

DOI10.4153/CJM-1979-108-0zbMath0465.20002WikidataQ56031593 ScholiaQ56031593MaRDI QIDQ3916721

Manley Perkel

Publication date: 1979

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

girthvalencypermutation groups acting on graphs

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Multiply transitive finite groups (20B20) Characterization theorems for permutation groups (20B10)

Related Items (8)

On 2-transitive graphs of girth 5 ⋮ On locally projective graphs of girth 5 ⋮ Association schemes with given stratum dimensions: on a paper of Peter M. Neumann ⋮ Trivalent 2-arc transitive graphs of type \(G^1_2\) are near polygonal ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ On narrow hexagonal graphs with a 3-homogeneous suborbit ⋮ A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth ⋮ Rank 4 groups with a 3-transitive suborbit

This page was built for publication: Bounding the Valency of Polygonal Graphs With Odd Girth