Linearly many faults in 2-tree-generated networks

DOI10.1002/NET.20319MaRDI QIDQ3057135zbMATH OpenOpenAlexFDO

Authors Eddie Cheng, L. Lipták, Fred Sala

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

zbMATH Keywords

alternating group graphCayley graphfault resiliencyinterconnection network

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Linearly many faults in Cayley graphs generated by transposition trees
• Hamiltonian connectivity of 2-tree-generated networks
• Hamiltonian edge-connectivity of 2-tree-generated networks
• Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
• Characterizing a kind of fault tolerance of alternating group network

Cites work

• A new class of interconnection networks based on the alternating group
• Arrangement graphs: A class of generalized star graphs
• Cuts leaving components of given minimum order
• Fault resiliency of Cayley graphs generated by transpositions
• Hamiltonian connectivity of 2-tree-generated networks
• scientific article; zbMATH DE number 5139492 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Increasing the connectivity of split-stars
• Increasing the connectivity of the star graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• On the maximal connected component of a hypercube with faulty vertices III
• On the maximal connected component of hypercube with faulty vertices
• Properties and characterizations of k ‐trees
• Restricted connectivity for three families of interconnection networks
• Super-connectivity and super-edge-connectivity for some interconnection networks
• The (n,k)-star graph: A generalized star graph
• The number of labeled k-dimensional trees

Cited in

(22)

• Hamiltonian connectivity of 2-tree-generated networks
• A kind of conditional fault tolerance of alternating group graphs
• Conditional fault tolerance of arrangement graphs
• Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
• Restricted connectivity and good-neighbor diagnosability of split-star networks
• Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
• Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model
• Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• On the conditional diagnosability of matching composition networks
• 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 Edge-Faults in 2-Bijective Connection Networks
• Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
• Component edge connectivity of hypercubes
• Fault diagnosability of arrangement graphs
• Hamiltonian edge-connectivity of 2-tree-generated networks
• Linearly many faults in arrangement graphs
• Fault tolerability of Cayley graphs generated by transposition unicyclic graphs with a triangle
• A generalized approach for solving non-inclusive diagnosability of regular networks under the PMC model
• Non-inclusive g-extra diagnosability of regular networks under the MM* model
• Reliability analysis of the cactus-based networks

This page was built for publication: Linearly many faults in 2-tree-generated networks

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