The Strongly Regular (45, 12, 3, 3) Graphs

13 years 4 months ago

Download www.combinatorics.org

Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters v = 45, k = 12, =

Kris Coolsaet, Jan Degraer, Edward Spence

Real-time Traffic

Automorphism Groups | Backtrack Algorithms | COMBINATORICS 2006 | Regular Graphs |

claim paper

» Short Cycles in Random Regular Graphs

» Lower connectivities of regular graphs with small diameter

» 3DVia Driven Partitioning for 3D VLSI Integrated Circuits

» A Strong Parallel Repetition Theorem for Projection Games on Expanders

» Maximum Matchings in Regular Graphs of High Girth

» High Degree Vertices Eigenvalues and Diameter of Random Apollonian Networks

» Capacity Scaling for Graph Cuts in Vision

» Deciding Relaxed TwoColorability A Hardness Jump

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	Kris Coolsaet, Jan Degraer, Edward Spence

Comments (0)

Sciweavers

The Strongly Regular (45, 12, 3, 3) Graphs

Automorphism Groups | Backtrack Algorithms | COMBINATORICS 2006 | Regular Graphs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers