Embedded connectivity of (n, k)-star graphs

DOI10.6043/J.ISSN.0438-0479.201811040MaRDI QIDQ5115205zbMATH OpenFDO

Authors Asiya Mijit, Vumar Elkin

Publication date 12 August 2020

zbMATH Keywords

connectivityinterconnection networksstar graph

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Conditional connectivity of star graph networks under embedding restriction
• Embedded connectivity of recursive networks
• Generalized connectivity of \((n,k)\)-star graphs
• Structure connectivity and substructure connectivity of star graphs
• Linearly many faults in \((n,k)\)-star graphs

Cited in

(12)

• Light 3-stars in embedded graphs
• The 4-set tree connectivity of \((n, k)\)-star networks
• Increasing the connectivity of the star graphs
• Path embedding in star graphs
• Structure connectivity and substructure connectivity of star graphs
• Maximal vertex-connectivity of
• Embedded connectivity of recursive networks
• Conditional connectivity of star graph networks under embedding restriction
• On cyclic-vertex connectivity of \((n, k)\)-star graphs
• On strong Menger-connectivity of star graphs
• On component connectivity of hierarchical star networks
• Generalized connectivity of \((n,k)\)-star graphs

This page was built for publication: Embedded connectivity of \( (n, k)\)-star graphs

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