T-irreducible extension of polygonal digraphs

DOI10.3103/S1066369X16020031zbMath1357.68149OpenAlexW2334906415MaRDI QIDQ283070

Alexander V. Gavrikov

Publication date: 13 May 2016

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x16020031

zbMATH Keywords

polygonal graphfault-tolerance of discrete systemsT-irreducible extension

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

T-IRREDUCIBLE EXTENSIONS OF DIRECTED STARLIKE TREES

Cites Work

• On the complexity of some problems related to graph extensions
• A Graph Model for Fault-Tolerant Computing Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: T-irreducible extension of polygonal digraphs