Maximal vertex-connectivity of

DOI10.1002/NET.20084MaRDI QIDQ3367056zbMATH OpenOpenAlexFDO

Authors Eddie Cheng, W. A. Lindsey, Daniel E. Steffy

Publication date 23 January 2006

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20084

zbMATH Keywords

connectivitydirected graphsdistributed computinginterconnection networks

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 1743821
• Embedded connectivity of \( (n, k)\)-star graphs
• Increasing the connectivity of the star graphs
• On the Day-Tripathi orientation of the star graphs: connectivity
• Linearly many faults in (n,k)-star graphs

Cites work

• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
• scientific article; zbMATH DE number 1118889 (Why is no real title available?)

Cited in

(9)

• Maximum independent sets partition of \((n, k)\)-star graphs
• On Hamiltonian properties of unidirectional hypercubes
• Linearly many faults in Cayley graphs generated by transposition trees
• On the Day-Tripathi orientation of the star graphs: connectivity
• Fault resiliency of Cayley graphs generated by transpositions
• scientific article; zbMATH DE number 1743821 (Why is no real title available?)
• Increasing the connectivity of the star graphs
• A brief account on the development and future research directions of connectivity properties of interconnection networks
• Orienting Cayley graphs generated by transposition trees

This page was built for publication: Maximal vertex-connectivity of

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