Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System

DOI10.14529/mmp170403zbMath1458.05215OpenAlexW2778803245MaRDI QIDQ4692095

Evgeny Ivanko

Publication date: 26 October 2018

Published in: Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vyuru399

zbMATH Keywords

graph isomorphismclosed semantic system

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• nauty
• Traces

Cites Work

• Practical graph isomorphism. II.
• An algorithm for the reduction of finite non-oriented graphs to canonical form
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• Unnamed Item
• Unnamed Item

This page was built for publication: Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System