An algorithm for the reduction of finite non-oriented graphs to canonical form

DOI10.1016/0041-5553(74)90114-1zbMath0304.05123OpenAlexW2086079863MaRDI QIDQ4058691

A. V. Uskov, V. L. Arlazarov, I. I. Zujev, I. A. Faradzhev

Publication date: 1975

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(74)90114-1

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System, Isomorphism Test for Digraphs with Weighted Edges.