Presentation 1993/9/30
Falt-Tolerant Graphs for Hypercubes
Toshinori Yamada, Shuichi Ueno,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Hypercubes / Matrix Graphs / Fault-Tolerant Graphs / Dimension- Fault-Tolerant Graphs / Linear Codes
Paper # CAS93-66
Date of Issue

Conference Information
Committee CAS
Conference Date 1993/9/30(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Falt-Tolerant Graphs for Hypercubes
Sub Title (in English)
Keyword(1) Hypercubes
Keyword(2) Matrix Graphs
Keyword(3) Fault-Tolerant Graphs
Keyword(4) Dimension- Fault-Tolerant Graphs
Keyword(5) Linear Codes
1st Author's Name Toshinori Yamada
1st Author's Affiliation Department of Electrical and Elctronic Engineering,Tokyo Institute of Technology()
2nd Author's Name Shuichi Ueno
2nd Author's Affiliation Department of Electrical and Elctronic Engineering,Tokyo Institute of Technology
Date 1993/9/30
Paper # CAS93-66
Volume (vol) vol.93
Number (no) 253
Page pp.pp.-
#Pages 6
Date of Issue