ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION

DOI10.17223/20710410/38/6MaRDI QIDQ5151083zbMATH OpenOpenAlexFDO

Authors M. B. Abrosimov, O. V. Modenova

Publication date 16 February 2021

Published in Prikladnaya diskretnaya matematika (Search for Journal in Brave)

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

zbMATH Keywords

minimal vertex extensionnode fault tolerancepath orientation

Mathematics Subject Classification ID

Combinatorics (05-XX) Information and communication theory, circuits (94-XX)

Cites work

• A Graph Model for Fault-Tolerant Computing Systems
• Characterization of graphs with a small number of additional arcs in a minimal 1-vertex extension
• Edge fault tolerance in graphs
• Fault tolerant token ring embedding in double loop networks.
• scientific article; zbMATH DE number 913340 (Why is no real title available?)
• scientific article; zbMATH DE number 914394 (Why is no real title available?)
• On the complexity of some problems related to graph extensions

Cited in

(1)

• scientific article; zbMATH DE number 3865313 (Why is no real title available?)

This page was built for publication: ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION

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