Representing equivalence problems for combinatorial objects

MaRDI QIDQ4639977zbMATH OpenFDO

Authors Mariya Dzhumalieva-Stoeva, Iliya G. Bouyukliev

Publication date 15 May 2018

Full work available at URL http://serdica-comp.math.bas.bg/index.php/serdicajcomputing/article/view/235

zbMATH Keywords

graphsisomorphismsbinary matricescombinatorial objects

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) General topics of discrete mathematics in relation to computer science (68R01) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Linear codes (general theory) (94B05)

Recommendations

• A general backtrack algorithm for the isomorphism problem of combinatorial objects
• Isomorph-Free Exhaustive Generation
• Permutation Groups and the Graph Isomorphism Problem
• On the cardinality of a factor set of binary matrices
• McKay's canonical graph labeling algorithm

Cited in

(4)

• Calculating the minimal number of homogeneous objects to represent a plurality in a heterogeneous system of objects
• Isomorphism and invariants of parallelisms of projective spaces
• The program \textsc{Generation} in the software package \textsc{QextNewEdition}
• On the cardinality of a factor set of binary matrices

This page was built for publication: Representing equivalence problems for combinatorial objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639977)