Robustness of star graph network under link failure

From MaRDI portal
Publication:2466079

DOI10.1016/j.ins.2007.09.013zbMath1126.68323OpenAlexW1981153478MaRDI QIDQ2466079

Xialong Wu, Ebrahim Saberinia, Shahram Latifi

Publication date: 11 January 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.09.013




Related Items

Network robustness and random processesThe largest component of faulty star graphs\(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) modelThe (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition TreesSubnetwork Preclusion of (n,k)-Star NetworksDiagnosability of star graphs with missing edgesSubstar reliability analysis in star networksConditional diagnosability and strong diagnosability of split-star networks under the PMC modelMeasuring the impact of MVC attack in large complex networksThe 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networksDistance formula and shortest paths for the \((n,k)\)-star graphsA new performance measure for characterizing fault rings in interconnection networksThe triangular pyramid: Routing and topological propertiesImproving bounds on link failure tolerance of the star graphProperties of a hierarchical network based on the star graphResearches for more reliable arrangement graphs in multiprocessor computer systemConditional fault tolerance in a class of Cayley graphsEmbedding Hamiltonian cycles in alternating group graphs under conditional fault modelFault tolerance in bubble-sort graph networksThe preclusion numbers and edge preclusion numbers in a class of Cayley graphsLink Failure Tolerance in the Arrangement GraphsSubnetwork preclusion for bubble-sort networks



Cites Work