2020
DOI: 10.1016/j.jpdc.2019.12.009
|View full text |Cite
|
Sign up to set email alerts
|

Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 24 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…B n has some small hypercubes Q k as subgraphs [14]. e hypercube Q n of dimension n is the graph whose vertex set is 0, 1 { } n (an n-bit character consisting of 0, 1) and where two vertices are adjacent if they differ in exactly one coordinate [15]. Q n has 2 n vertices and 2 n− 1 n edges.…”
Section: E Modified Bubble-sort Graphmentioning
confidence: 99%
“…B n has some small hypercubes Q k as subgraphs [14]. e hypercube Q n of dimension n is the graph whose vertex set is 0, 1 { } n (an n-bit character consisting of 0, 1) and where two vertices are adjacent if they differ in exactly one coordinate [15]. Q n has 2 n vertices and 2 n− 1 n edges.…”
Section: E Modified Bubble-sort Graphmentioning
confidence: 99%