nauty

swMATH611MaRDI QIDQ13366

No author found.

Described by source

No records found.

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

Totally magic graphs ⋮ Linear programming in some Ramsey problems ⋮ On the classification of linear complementary dual codes ⋮ Classification of hyperovals in \(PG(2,32)\) ⋮ Detecting almost symmetries of graphs ⋮ The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ A microcomputer based system for small relation algebras ⋮ The QAP-polytope and the graph isomorphism problem ⋮ Yet another distance regular graph related to a Golay code ⋮ The translation planes of order 49 ⋮ Augmenting the algebraic connectivity for certain families of graphs ⋮ A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees ⋮ New (100, 45, 20) symmetric designs and Bush-type Hadamard matrices of order 100 ⋮ Small clique number graphs with three trivial critical ideals ⋮ Enumeration of semi-Latin squares ⋮ Aspects of complete sets of \(9\times 9\) pairwise orthogonal latin squares ⋮ Some \(6\times 11\) Youden squares and double Youden rectangles ⋮ 3- and 4-critical graphs of small even order ⋮ Perturbations in a signed graph and its index ⋮ Partitions of sets of designs on seven, eight and nine points ⋮ Determinants of matrices of the conference type ⋮ Overlarge sets and partial geometries ⋮ Graph products and monochromatic multiplicities ⋮ On panel-regular \(\tilde{A}_2\) lattices ⋮ Normal edge-transitive Cayley graphs of Frobenius groups ⋮ Counting arcs in projective planes via Glynn's algorithm ⋮ Enumeration of Seidel matrices ⋮ Complete mining of frequent patterns from graphs: Mining graph data ⋮ There is no McLaughlin geometry ⋮ Pruning by isomorphism in branch-and-cut ⋮ A complete \(L (2, 1)\) span characterization for small trees ⋮ An infinite family of excluded minors for strong base-orderability ⋮ On the degree distance of unicyclic graphs with given matching number ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ 16,051 formulas for Ottaviani's invariant of cubic threefolds ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Variable symmetry breaking in numerical constraint problems ⋮ Affine symmetries of orbit polytopes ⋮ Classification of whist tournaments with up to 12 players ⋮ A computational approach to construct a multivariate complete graph invariant ⋮ Turán numbers for odd wheels ⋮ Matching-star Ramsey minimal graphs ⋮ Some Menon designs having U(3, 3) as an automorphism group ⋮ Integer sequence discovery from small graphs ⋮ Constructing the vertex-transitive graphs of order 24 ⋮ The journey of graph kernels through two decades ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ Exploiting orbits in symmetric ILP ⋮ Geometric realisation of the graphs of McKay-Miller-Širáň ⋮ Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index ⋮ Steiner triple systems of order 19 and 21 with subsystems of order 7 ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ The sextuply shortened binary Golay code is optimal ⋮ On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ Computing subfields of number fields and applications to Galois group computations ⋮ Partitioning sets of quadruples into designs. III ⋮ The 2-rotational Steiner triple systems of order 25 ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ Enumeration of 2-level polytopes ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ General embedding problems and two-distance sets in Minkowski planes ⋮ On the \(A_{\alpha}\)-characteristic polynomial of a graph ⋮ Binomial edge ideals of bipartite graphs ⋮ The binary self-dual codes of length up to 32: A revised enumeration ⋮ The block-transitive, point-imprimitive 2-(729,8,1) designs ⋮ There exists no Steiner system \(S(4,5,17)\) ⋮ An optimal lower bound on the number of variables for graph identification ⋮ On distance-balanced graphs ⋮ Combinatorial cube packings in the cube and the torus ⋮ Line-transitive point-imprimitive linear spaces: the grid case ⋮ The minimum rank problem over the finite field of order 2: Minimum rank 3 ⋮ Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) ⋮ Graph structural properties of non-Yutsis graphs allowing fast recognition ⋮ Small weight codewords in the codes arising from Desarguesian projective planes ⋮ Edge local complementation and equivalence of binary linear codes ⋮ 2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes ⋮ Statistical designs for two-color microarray experiments involving technical replication ⋮ Classification of the (0, 2)-graphs of valency 8 ⋮ Partitioning sets of quadruples into designs. I ⋮ Linear optimization over permutation groups ⋮ Nearly linear time algorithms for permutation groups: An interplay between theory and practice ⋮ Some tapas of computer algebra ⋮ A note on large graphs of diameter two and given maximum degree ⋮ Higmanian rank-5 association schemes on 40 points ⋮ A new distance-regular graph associated to the Mathieu group \(M_{10}\) ⋮ Flag-transitive symmetric 2-(96,20,4)-designs ⋮ Orbifold triangulations and crystallographic groups ⋮ Graph based isomorph-free generation of two-level regular fractional factorial designs ⋮ Automatic symmetry detection for Promela ⋮ Topological configurations \((n_4)\) exist for all \(n\geq 17\) ⋮ Perfect Graeco-Latin balanced incomplete block designs (pergolas) ⋮ The distance-regular graphs of valency four ⋮ The computation of chromatic polynomials ⋮ An orderly algorithm and some applications in finite geometry ⋮ On the structure and classification of SOMAs: Generalizations of mutually orthogonal Latin squares ⋮ Non-Cayley vertex-transitive graphs of order twice the product of two odd primes ⋮ Enumerating \(4\times 5\) and \(5\times 6\) double Youden rectangles ⋮ On self-clique shoal graphs ⋮ Classification algorithms for codes and designs

This page was built for software: nauty