Linearly many faults in 2-tree-generated networks
From MaRDI portal
Publication:3057135
DOI10.1002/net.20319zbMath1207.05076OpenAlexW4237876653MaRDI QIDQ3057135
László Lipták, Fred Sala, Eddie Cheng
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/64908
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (14)
Reliability analysis of the cactus-based networks ⋮ On the conditional diagnosability of matching composition networks ⋮ Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ Linearly many faults in arrangement graphs ⋮ A kind of conditional fault tolerance of alternating group graphs ⋮ Restricted connectivity and good-neighbor diagnosability of split-star networks ⋮ Conditional fault tolerance of arrangement graphs ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ Fault diagnosability of arrangement graphs ⋮ Component Edge Connectivity of Hypercubes ⋮ Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian connectivity of 2-tree-generated networks
- Arrangement graphs: A class of generalized star graphs
- The \((n,k)\)-star graph: A generalized star graph
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Cuts leaving components of given minimum order
- Restricted connectivity for three families of interconnection networks
- Linearly many faults in Cayley graphs generated by transposition trees
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- On the maximal connected component of a hypercube with faulty vertices III
- Increasing the connectivity of the star graphs
- On the maximal connected component of hypercube with faulty vertices
- A new class of interconnection networks based on the alternating group
- The number of labeled k-dimensional trees
- Properties and characterizations of k ‐trees
This page was built for publication: Linearly many faults in 2-tree-generated networks
