The following pages link to nauty (Q13366):
Displaying 50 items.
- Orbital branching (Q623461) (← links)
- Some properties of graphs determined by edge zeta functions (Q624533) (← links)
- Schur indices of association schemes (Q626743) (← links)
- Numerical measures for two-graphs (Q627376) (← links)
- Automorphism groups of root system matroids (Q627925) (← links)
- The cocyclic Hadamard matrices of order less than 40 (Q629882) (← links)
- Roots of Ehrhart polynomials arising from graphs (Q644696) (← links)
- The cycle switching graph of the Steiner triple systems of order 19 is connected (Q659722) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Entanglement in eight-qubit graph states (Q662917) (← links)
- The classification of Steiner triple systems on 27 points with 3-rank 24 (Q670206) (← links)
- A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\) (Q697981) (← links)
- Posets on up to 16 points (Q698446) (← links)
- Schur rings and non-symmetric association schemes on 64 vertices (Q712248) (← links)
- Examples of Kähler-Einstein toric Fano manifolds associated to non-symmetric reflexive polytopes (Q717828) (← links)
- Generating stable modular graphs (Q719749) (← links)
- The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles (Q723608) (← links)
- Mappings of Butson-type Hadamard matrices (Q724843) (← links)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (Q730257) (← links)
- New quasi-symmetric designs by the Kramer-Mesner method (Q738841) (← links)
- Infinite families of directed strongly regular graphs using equitable partitions (Q738851) (← links)
- Generating all finite modular lattices of a given size (Q745707) (← links)
- On bipartite graphs of defect at most 4 (Q765348) (← links)
- Kirkman triple systems with subsystems (Q776280) (← links)
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- More forbidden minors for wye-delta-wye reducibility (Q813923) (← links)
- Classification algorithms for codes and designs (Q819932) (← links)
- On the number of frequency hypercubes \(F^n(4;2,2) \) (Q820504) (← links)
- Comparing Wiener complexity with eccentric complexity (Q827592) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Characterization and classification of optimal LCD codes (Q831153) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- Automatic proof of graph nonisomorphism (Q841683) (← links)
- Computing automorphisms of semigroups. (Q846358) (← links)
- Symmetry definitions for constraint satisfaction problems (Q850464) (← links)
- There are 1239 Steiner triple systems \(STS(31)\) of 2-rank 27 (Q851747) (← links)
- Projective two-weight codes with small parameters and their corresponding graphs (Q851774) (← links)
- The complexity of chromatic strength and chromatic edge strength (Q853645) (← links)
- Medial layer graphs of equivelar 4-polytopes (Q854805) (← links)
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12 (Q855831) (← links)
- The Steiner quadruple systems of order 16 (Q855876) (← links)
- Designs on the web (Q856844) (← links)
- Predicting and detecting symmetries in FOL finite model search (Q861703) (← links)
- On the existence of difference sets in groups of order 96 (Q861793) (← links)
- Cospectral graphs and the generalized adjacency matrix (Q876300) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Enumeration of unlabelled mating graphs (Q879945) (← links)
- The minimal spectral radius of graphs with a given diameter (Q880046) (← links)
- Orderly algorithm to enumerate central groupoids and their graphs (Q884884) (← links)
- Normal edge-transitive Cayley graphs of Frobenius groups (Q887943) (← links)
