Globally bi-3*-connected graphs
From MaRDI portal
Publication:1025446
DOI10.1016/j.disc.2008.03.015zbMath1184.05076OpenAlexW1994514829MaRDI QIDQ1025446
Lih-Hsing Hsu, Shin-Shin Kao, Hong-Chun Hsu
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.015
Related Items (3)
On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\) ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal 1-Hamiltonian graphs
- Christmas tree: a versatile 1-fault-tolerant design for token rings
- On the spanning connectivity of graphs
- On the spanning connectivity and spanning laceability of hypercube-like networks
- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
- Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
- Cubic planar Hamiltonian graphs of various types
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
- Edge fault tolerance in graphs
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
This page was built for publication: Globally bi-3*-connected graphs
