Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection

DOI10.18500/1816-9791-2020-20-1-105-115zbMath1442.68016OpenAlexW3011067952MaRDI QIDQ5122697

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

Publication date: 23 September 2020

Published in: Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Vertex extensions of 4-layer graphs and hypercubes ⋮ CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION ⋮ About uniqueness of the minimal 1-edge extension of hypercube Q4

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of some problems related to graph extensions
• Practical graph isomorphism. II.
• A Graph Model for Fault-Tolerant Computing Systems
• Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives
• Edge fault tolerance in graphs

This page was built for publication: Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection