nauty

swMATH611MaRDI QIDQ13366

No author found.

Described by source

No records found.

Related Items (only showing first 100 items - show all)

On self-clique shoal graphs ⋮ Classification algorithms for codes and designs ⋮ On the number of frequency hypercubes \(F^n(4;2,2) \) ⋮ Strategic balance in graphs ⋮ Comparing Wiener complexity with eccentric complexity ⋮ Biregular graphs with three eigenvalues ⋮ Exploiting symmetries in mathematical programming via orbital independence ⋮ Binary determinantal complexity ⋮ Characterization and classification of optimal LCD codes ⋮ Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four ⋮ Orthogonal trades and the intersection problem for orthogonal arrays ⋮ Automatic proof of graph nonisomorphism ⋮ Computing automorphisms of semigroups. ⋮ A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space ⋮ Symmetry definitions for constraint satisfaction problems ⋮ There are 1239 Steiner triple systems \(STS(31)\) of 2-rank 27 ⋮ Projective two-weight codes with small parameters and their corresponding graphs ⋮ The complexity of chromatic strength and chromatic edge strength ⋮ Medial layer graphs of equivelar 4-polytopes ⋮ On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12 ⋮ The Steiner quadruple systems of order 16 ⋮ On maximal relative projection constants ⋮ Designs on the web ⋮ Optimal-depth sorting networks ⋮ A comparison of integer and constraint programming models for the deficiency problem ⋮ Lower bounds for locally highly connected graphs ⋮ Predicting and detecting symmetries in FOL finite model search ⋮ On the existence of difference sets in groups of order 96 ⋮ On the extremal properties of the average eccentricity ⋮ An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ Obstructions for embedding cubic graphs on the spindle surface ⋮ Cospectral graphs and the generalized adjacency matrix ⋮ Old and new results on algebraic connectivity of graphs ⋮ On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs ⋮ Enumeration of unlabelled mating graphs ⋮ Classification of triangle-free \(22_3\) configurations ⋮ The minimal spectral radius of graphs with a given diameter ⋮ Orderly algorithm to enumerate central groupoids and their graphs ⋮ Special cycles in independence complexes and superfrustration in some lattices ⋮ Fractionation in planar kinematic chains: reconciling enumeration contradictions ⋮ Generation of various classes of trivalent graphs ⋮ Enumerating cube tilings ⋮ There is no \([21,5,14\) code over \(\mathbb F_5\)] ⋮ The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) ⋮ Computing the autotopy group of a Latin square by cycle structure ⋮ Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases ⋮ Classification of difference matrices over cyclic groups ⋮ Switching in one-factorisations of complete graphs ⋮ Efficient approximate verification of B and Z models via symmetry markers ⋮ Minimal strong digraphs ⋮ Note on PI and Szeged indices ⋮ Orbital branching ⋮ Set-homogeneous directed graphs ⋮ Some properties of graphs determined by edge zeta functions ⋮ Schur indices of association schemes ⋮ Numerical measures for two-graphs ⋮ Automorphism groups of root system matroids ⋮ The cocyclic Hadamard matrices of order less than 40 ⋮ Partitions, Kostka polynomials and pairs of trees ⋮ On the Ramsey number \(R(4,6)\) ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ Closest multiplication tables of groups ⋮ Roots of Ehrhart polynomials arising from graphs ⋮ Exploiting symmetries for single- and multi-agent partially observable stochastic domains ⋮ Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ The cycle switching graph of the Steiner triple systems of order 19 is connected ⋮ On the maximum length of coil-in-the-box codes in dimension 8 ⋮ On hypercube packings, blocking sets and a covering problem ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ Entanglement in eight-qubit graph states ⋮ Stabilizer-based symmetry breaking constraints for mathematical programs ⋮ The classification of Steiner triple systems on 27 points with 3-rank 24 ⋮ Multi-parameterised compositional verification of safety properties ⋮ Obstructions to convexity in neural codes ⋮ On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters ⋮ \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions ⋮ Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 ⋮ Multi-Latin squares ⋮ Complete and almost complete minors in double-critical 8-chromatic graphs ⋮ A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\) ⋮ Posets on up to 16 points ⋮ Uniqueness of graph square roots of girth six ⋮ Schur rings and non-symmetric association schemes on 64 vertices ⋮ Examples of Kähler-Einstein toric Fano manifolds associated to non-symmetric reflexive polytopes ⋮ Generating stable modular graphs ⋮ The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles ⋮ Mappings of Butson-type Hadamard matrices ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ New quasi-symmetric designs by the Kramer-Mesner method ⋮ Infinite families of directed strongly regular graphs using equitable partitions ⋮ Generating all finite modular lattices of a given size ⋮ polyDB: A Database for Polytopes and Related Objects ⋮ The Schläfli Fan ⋮ On bipartite graphs of defect at most 4 ⋮ Kirkman triple systems with subsystems ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ More forbidden minors for wye-delta-wye reducibility ⋮ Some Bush-type Hadamard matrices

This page was built for software: nauty