The Number of Cyclic Configurations of Type (v3) and the Isomorphism Problem
DOI10.1002/jcd.21387zbMath1292.05189arXiv1301.2445OpenAlexW2167222274MaRDI QIDQ5166478
Tomaž Pisanski, István Kovács, Hiroki Koike
Publication date: 27 June 2014
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.2445
Exact enumeration problems, generating functions (05A15) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Other finite incidence structures (geometric aspects) (51E30)
Related Items (7)
Cites Work
- Unnamed Item
- The isomorphism problem for abelian projective planes
- On the isomorphism problem for cyclic combinatorial objects
- Cyclic Haar graphs
- Multipliers and generalized multipliers of cyclic objects and cyclic codes
- Isomorphism problem for relational structures with a cyclic automorphism
- The equivalence of two cyclic objects on \(pq\) elements
- Counting symmetric configurations \(v_3\)
- Configurations from a Graphical Viewpoint
- Isomorphic tetravalent cyclic Haar graphs
- Enumeration of I-graphs: Burnside does it again
- Isomorphism problem for a class of point-symmetric structures
- I-graphs and the corresponding configurations
This page was built for publication: The Number of Cyclic Configurations of Type (v3) and the Isomorphism Problem