FUNCTION OF STRUCTURAL FAULT TOLERANCE AND D-Limited CONNECTED COMPONENT OF CS GRAPH

Prikladnaya Diskretnaya Matematika - Russian Federation
doi 10.17223/20710410/2/22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

On the Distance Function of a Connected Graph

Czechoslovak Mathematical Journal
Mathematics
2008English

Using the Structural Fault-Tolerance Index in Project Designing

Odes’kyi Politechnichnyi Universytet. Pratsi
2014English

Scaling Limit for the Random Walk on the Largest Connected Component of the Critical Random Graph

Publications of the Research Institute for Mathematical Sciences
Mathematics
2012English

Architecting Resilient Computing Systems: A Component-Based Approach for Adaptive Fault Tolerance

Journal of Systems Architecture
HardwareArchitectureSoftware
2017English

Inverse and Disjoint Connected Cototal Domination Number of the Jump Graph of a Graph

International Journal of Research in Advent Technology
2019English

Every 3-Connected, Locally Connected, Claw-Free Graph Is Hamilton-Connected

Journal of Graph Theory
GeometryTopology
1996English

Structural Characterization and Raman Spectrum of Cs[OCN]

Zeitschrift fur Naturforschung - Section B Journal of Chemical Sciences
Chemistry
2020English

Measuring Masking Fault-Tolerance

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Global Triple Connected Domination Number of a Graph

IOSR Journal of Mathematics
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy