- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Automatic Translation feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Falt-Tolerant Graphs for Hypercubes
-
- Yamada Toshinori
- Department of Electrical and Elctronic Engineering,Tokyo Institute of Technology
-
- Ueno Shuichi
- Department of Electrical and Elctronic Engineering,Tokyo Institute of Technology
Bibliographic Information
- Other Title
-
- ハイパーキューブの耐故障グラフ
Search this article
Description
Given an n-vertex graph H,an n-vertex graph G is called a t- fault-tolerant graph for H if the graph obtained from G by deleting any t edges contains H as a subgraph.△(t,H)is the minimum of known that △(1,Q(n))= 2^n-1>,where Q(n)is the n-cube.This paper s hows that △(t,Q(n))= O(t2^n-1> log n)(2【less than or equal】tn ln 2),which is a natural generalization of the result above.This is shown by constructing t-fault-tolerant graphs for hypercubes from error-correcting linear codes.
Journal
-
- IEICE technical report. Circuits and systems
-
IEICE technical report. Circuits and systems 93 (253), 81-86, 1993-09-30
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1571698602306589696
-
- NII Article ID
- 110003198233
-
- NII Book ID
- AN10013094
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles
