Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives

DOI10.18500/1816-9791-2019-19-4-479-486zbMath1434.05143OpenAlexW2996716297MaRDI QIDQ5218295

Ikhab Aabdzhuldzhabbar Kamil Kamil, Aleksandr Andreevich Lobov, M. B. Abrosimov

Publication date: 2 March 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/isu823

zbMATH Keywords

vertex \(k\)-extension of a graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Vertex extensions of 4-layer graphs and hypercubes ⋮ Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection ⋮ CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION ⋮ About uniqueness of the minimal 1-edge extension of hypercube Q4

Uses Software

• nauty
• Traces

Cites Work

• On the complexity of some problems related to graph extensions
• Practical graph isomorphism. II.
• A Graph Model for Fault-Tolerant Computing Systems
• Edge fault tolerance in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives