Name
Abstract | ||
|---|---|---|
Given a graph G and a non-negative integer h, the h-extra connectivity (or h-extra edge-connectivity, resp.) of G, denoted by h(G) (or h(G), resp.), is the minimum cardinality of a set of vertices (or edges, resp.) in G, if it exists, whose deletion disconnects G and leaves each remaining component with more than h vertices. In this paper, we obtain a tight upper bound of the h-extra connectivity and the h-extra edge-connectivity of n-dimensional balanced hypercubes BHn for n2 and h2n1. As an application, we prove that 4(BHn)=5(BHn)=6n8 and 3(BHn)=8n8, which improves the previously known results given by Yang (2012) and L (2017).
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.amc.2017.10.005 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Balanced hypercube, Extra connectivity, Extra edge-connectivity, Interconnection networks, Reliability | Integer,Graph,Combinatorics,Vertex (geometry),Mathematical analysis,Upper and lower bounds,Cardinality,Mathematics,Hypercube | Journal |
Volume | ISSN | Citations |
320 | 0096-3003 | 1 |
PageRank | References | Authors |
0.36 | 20 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dawei Yang | 1 | 6 | 2.79 |
| Yan-quan Feng | 2 | 350 | 41.80 |
| Jaeun Lee | 3 | 110 | 22.10 |
| Jin-Xin Zhou | 4 | 156 | 25.22 |