T-irreducible extension of polygonal digraphs

DOI10.3103/S1066369X16020031zbMATH Open1357.68149OpenAlexW2334906415MaRDI QIDQ283070FDOQ283070

Authors: 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

Recommendations

• T-irreducible extensions of directed starlike trees
• T-irreducible extension for union of paths and cycles
• Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs
• On properties of minimal extensions of orgraphs
• scientific article; zbMATH DE number 1498519

zbMATH Keywords

fault-tolerance of discrete systemspolygonal graphT-irreducible extension

Mathematics Subject Classification ID

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

Cites Work

• A Graph Model for Fault-Tolerant Computing Systems
• Title not available (Why is that?)
• The ordered set of connected parts of a polygonal graph
• On the complexity of some problems related to graph extensions

Cited In (2)

• T-irreducible extensions of directed starlike trees
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283070)