Explicit construction of linear sized tolerant networks
- 1 December 1988
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 72 (1-3) , 15-19
- https://doi.org/10.1016/0012-365x(88)90189-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Expanding graphs contain all small treesCombinatorica, 1987
- Eigenvalues and expandersCombinatorica, 1986
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- On Universal Graphs for Spanning TreesJournal of the London Mathematical Society, 1983
- On size Ramsey number of paths, trees, and circuits. IJournal of Graph Theory, 1983
- A SURVEY OF NONCOMPLETE RAMSEY THEORY FOR GRAPHSAnnals of the New York Academy of Sciences, 1979
- The size Ramsey numberPeriodica Mathematica Hungarica, 1978
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On sparse graphs with dense long pathsComputers & Mathematics with Applications, 1975