The number of cyclic configurations of type (v₃) and the isomorphism problem
From MaRDI portal
Publication:5166478
Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Other finite incidence structures (geometric aspects) (51E30)
Abstract: A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have v points and lines, and each point/line is incident with exactly 3 lines/points. In addition, a Bays-Lambossy type theorem is proved for cyclic configurations if the number of points is a product of two primes or a prime power.
Recommendations
Cites work
- Configurations from a graphical viewpoint
- Counting symmetric configurations \(v_3\)
- Cyclic Haar graphs
- Enumeration of I-graphs: Burnside does it again
- scientific article; zbMATH DE number 4055624 (Why is no real title available?)
- I-graphs and the corresponding configurations
- Isomorphic tetravalent cyclic Haar graphs
- Isomorphism problem for a class of point-symmetric structures
- Isomorphism problem for relational structures with a cyclic automorphism
- Multipliers and generalized multipliers of cyclic objects and cyclic codes
- On the isomorphism problem for cyclic combinatorial objects
- The equivalence of two cyclic objects on pq elements
- The isomorphism problem for abelian projective planes
Cited in
(12)- Polycyclic configurations
- On resolvable Golomb rulers, symmetric configurations and progressive dinner parties
- Chiral astral realizations of cyclic 3-configurations
- Cyclic groups are CI-groups for balanced configurations
- Classification of \({(v,3)}\)-configurations
- Which Haar graphs are Cayley graphs?
- Splittable and unsplittable graphs and configurations
- Existence of cyclic (3, )-GDD of type g^v having prescribed number of short orbits
- Classification of cyclic Steiner quadruple systems
- Rotary polygons in configurations
- Isomorphisms of cubic Cayley graphs on dihedral groups and sparse circulant matrices
- Irreducible \((v_{3})\) configurations and graphs
This page was built for publication: The number of cyclic configurations of type \((v_{3})\) and the isomorphism problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166478)