Super spanning connectivity of split-star networks
From MaRDI portal
Publication:2224849
DOI10.1016/j.ipl.2020.106037zbMath1506.68081OpenAlexW3092061411MaRDI QIDQ2224849
Publication date: 4 February 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2020.106037
Related Items (2)
Structure connectivity and substructure connectivity of split-star networks ⋮ Degree sequence conditions for a graph to be disjoint path coverable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault tolerance of edge pancyclicity in alternating group graphs
- One-to-one disjoint path covers on alternating group graphs
- The super laceability of the hypercubes
- On the spanning connectivity and spanning laceability of hypercube-like networks
- An efficient distributed algorithm for canonical labeling on directed split-stars
- Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
- Super spanning connectivity on WK-recursive networks
- The super-connected property of recursive circulant graphs
- One-to-one disjoint path covers on multi-dimensional tori
This page was built for publication: Super spanning connectivity of split-star networks