Given a graph <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${\mbi{G}}$</tex> </formula> and non-negative integer Notation="TeX">${{g}}$</tex> , the -extra connectivity (resp. edge connectivity) of is minimum cardinality set vertices edges) in if it exists, whose deletion disconnects leaves each remaining component with more than vertices. This study shows that 3-extra an...

With the rapid increase of number processors in multiprocessor systems and fast expansion interconnection networks, reliability network is facing severe challenges, where recognition fault crucial. In practice, most processor failures are intermittent faults. this article, we first determine diagnosability <inline-formula><tex-math notation="LaTeX">$t_{I}^{PMC}(S_{n}^{2})$</tex-math></inline-formula> notation="LaTeX">$n$</tex-math></inline-formula> -dimensional split-star...

The arrangement graph A/sub n,k/, which is a generalization of the star (n-k=1), presents more flexibility than in adjusting major design parameters: number nodes, degree, and diameter. Previously, has proved Hamiltonian. In this paper, we further show that remains Hamiltonian even if it faulty. Let |F/sub e/| v/| denote numbers edge faults vertex faults, respectively. We n,k/ when 1) (k=2 n-k/spl ges/4, or k/spl ges/3 ges/4+[k/2]), e/|/spl les/k(n-k)-2, 2) ges/2, ges/2+[k/2],...

Processor fault diagnosis has played an important role in measuring the reliability of a multiprocessor system, and diagnosability many well-known systems been widely investigated. The conditional is novel measure by adding additional condition that any faulty set cannot contain all neighbors node system. In this paper, we evaluate for augmented cubes under PMC model. We show n-dimensional cube 8n - 27 n≥5.

Processor fault diagnosis plays an important role in measuring the reliability of multiprocessor systems and diagnosing many well-known interconnection networks. Conditional diagnosability is a novel measure that adds additional condition any faulty set cannot contain all neighbors vertex system. This study investigates some topological properties k-ary n-cubes, where k ≥ 4 n 4, shows conditional n-cubes under comparison model 6n - 5.

Connectivity is a classic measure for fault tolerance of network in the case vertices failures. Extra connectivity and restricted are two important indicators robustness multi-processor system presence failing processors. An interconnection network's diagnosability an its self-diagnostic capability. The conditional widely accepted as new by assuming that any fault-set cannot contain all neighbors node multiprocessor system. In this paper, we analyze combinatorial properties ability...

Processor fault diagnosis has played an important role in measuring the reliability of a multiprocessor system; diagnosability many well-known systems been widely investigated. Conditional is novel measure diagnosability. It includes condition whereby any set cannot contain all neighbors node system. In this paper, conditional star graphs by using PMC model evaluated. Several new structural properties are derived. Based on these properties, <formula formulatype="inline"...

The h-extra node-connectivity of a graph G is the size minimal node-set, whose removal will disconnect G, but each remaining component has no fewer h + 1 nodes. Based on node-connectivity, conditional fault-diagnosability networks been proposed for better, more realistic measure networks' fault-tolerability. It maximal x such that conditionally x-fault-diagnosable. This paper establish relationship between and regular under classic PMC diagnostic model. We apply newly found to variety...

Extra connectivity is an important indicator of the robustness a multiprocessor system in presence failing processors. The g-extra conditional diagnosability and t/m-diagnosability are two diagnostic strategies at system-level that can significantly enhance system's self-diagnosing capability. defined under assumption every component removing set faulty vertices has more than g vertices. t/m-diagnosis strategy detect up to t processors which might include most m misdiagnosed processors,...

Suppose that G is a bipartite graph with its partite sets of equal size. said to be strongly Hamiltonian-laceable if there Hamiltonian path between every two vertices belong different and (maximal) length N - 2 the same set, where order G. In other words, has longest vertices. this paper, we show star graphs dimension four or larger are Hamiltonian-laceable. © 2000 john Wiley & Sons, Inc.

The problem of fault diagnosis has been discussed widely, and the diagnosability many well-known networks explored. Strong diagnosability, conditional are both novel measurements for evaluating reliability tolerance a system. In this paper, some useful sufficient conditions proposed to determine strong We then apply them show that an n-dimensional augmented cube AQ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> is strongly (2n...

Using the comparison diagnosis model, this study proposes some useful sufficient conditions for determining strong diagnosability t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> (G) and conditional xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> of a system G. Applying these results to an n-dimensional folded hypercube FQ xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> shows that ts(FQ ) = n + 1 ≥ 5 (FQ 3n - 2 5. Moreover,...

The g-restricted connectivity (g-RC) is the minimum vertex-set size of a network, whose deletion disconnects network such that each remaining vertex has at least g neighbors in its respective component. g-RC deterministic indicator tolerability with failing processors. g-good-neighbor fault diagnosability (g-GNFD) largest set correctly identified faulty vertices any good no fewer neighbors. This paper establishes relationship between and g-GNFD general regular networks, first under PMC model...

Fault diagnosis is constantly crucial to maintain a high level of multiprocessor systems' reliability. In systems, global fault has been extensively investigated under both deterministic and probabilistic models, while local only committed the such as PMC model MM <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$^*$</tex-math> </inline-formula> model. This work focuses on approach for at node within mixed...

Brain midline shift (MLS) indicates the severity of mass effect from intracranial lesions such as traumatic brain injury, stroke, tumor, or hematoma. MLS can be used to determine whether patients require emergency surgery and predict patients' prognosis. Since is usually emergent, it must diagnosed immediately. Therefore, this study presents a computer-aided deep-learning method for detecting MLS, aiming mortality in prognosis-predicting cohort using clinical in-formation. The 3-dimensional...