Bounding the Valency of Polygonal Graphs With Odd Girth

DOI10.4153/CJM-1979-108-0MaRDI QIDQ3916721zbMATH OpenWikidataFDO

Authors Manley Perkel

Publication date 1979

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

Full work available at URL https://doi.org/10.4153/CJM-1979-108-0

zbMATH Keywords

girthpermutation groups acting on graphsvalency

Mathematics Subject Classification ID

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

Cited in

(8)

• Rank 4 groups with a 3-transitive suborbit
• On 2-transitive graphs of girth 5
• On locally projective graphs of girth 5
• Some spectral and quasi-spectral characterizations of distance-regular graphs
• On narrow hexagonal graphs with a 3-homogeneous suborbit
• 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
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916721)