CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION

DOI10.17223/20710410/48/7zbMath1459.05213OpenAlexW3047521914MaRDI QIDQ5151447

M. B. Abrosimov, Ikhab Aabdzhuldzhabbar Kamil Kamil, Aleksandr Andreevich Lobov, Hayder Hussein Karim Sudani

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

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

zbMATH Keywords

isomorphismsupergraphcanonical formisomorphism rejection

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• nauty
• Traces
• GENREG
• snarkhunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical graph isomorphism. II.
• Fast generation of regular graphs and construction of cages
• Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection
• COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH
• Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives
• The Generation of Fullerenes

This page was built for publication: CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION