Discrete Applied Mathematics, Volume 37/38

Volume 37/38, 1992

• Jean-Claude Bermond:
  Foreword. 1
  
• James Allwright:
  New (Delta, D) Graphs Discovered by Heuristic Search. 3-8
  
• Noga Alon:
  Transmitting in the n-Dimensional Cube. 9-11
  
• Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert:
  A Survey of Integrity. 13-28
  
• Reuven Bar-Yehuda, Tuvi Etzion:
  Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks. 29-43
  
• Pietro Camarda, Mario Gerla:
  Design and Analysis of Fault-Tolerant Multibus Interconnection Networks. 45-64
  
• Lowell Campbell:
  Dense Group Networks. 65-71
  
• Fan R. K. Chung:
  Graphs with Small Diameter After Edge Deletion. 73-94
  
• Gene Cooperman, Larry Finkelstein:
  New Methods for Using Cayley Graphs in Interconnection Networks. 95-118
  
• Sajal K. Das, Joydeep Ghosh, Narsingh Deo:
  Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. 119-146
  
• Wenceslas Fernandez de la Vega, Yannis Manoussakis:
  The Forwarding Index of Communication Networks with Given Connectivity. 147-155
  
• Charles Delorme:
  Examples of Products Giving Large Graphs with Given Degree and Diameter. 157-167
  
• Ding-Zhu Du, D. Frank Hsu, G. W. Peck:
  Connectivity of Consecutive-d Digraphs. 169-177
  
• Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
  Generalized Degrees and Menger Path Systems. 179-191
  
• Harold Fredricksen:
  A New Look at the de Bruijn Graph. 193-203
  
• Arif Ghafoor:
  Connectivity, Persistence and Fault Diagnosis of Interconnection Networks Based on O_k and 2O_k Graphs. 205-226
  
• José Gómez, Miguel Angel Fiol, J. Luis A. Yebra:
  Graphs on Alphabets as Models for Large Interconnection Networks. 227-243
  
• Jesse M. Gordon:
  Analysis of Minimal Path Routing Schemes in the Presence of Faults. 245-263
  
• Niall Graham, Frank Harary:
  Changing and Unchanging the Diameter of a Hypercube. 265-274
  
• Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
  The Connectivity of Hierarchical Cayley Digraphs. 275-280
  
• Katherine Heinrich, Kichul Kim, Viktor K. Prasanna:
  Perfect Latin Squares. 281-286
  
• Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau:
  Forwarding Indices of k-Connected Graphs. 287-296
  
• Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
  Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. 297-317
  
• Henk D. L. Hollmann, Jacobus H. van Lint:
  Nonblocking Self-Routing Switching Networks. 319-340
  
• Xiao-Dong Hu, Frank K. Hwang:
  An Improved Upper Bound for the Subarray Partial Concentrators. 341-346
  
• Leif K. Jørgensen:
  Diameters of Cubic Graphs. 347-351
  
• William M. Kantor:
  Some Large Trivalent Graphs Having Small Diameters. 353-357
  
• Clyde P. Kruskal, Marc Snir:
  Cost-Performance Tradeoffs for Interconnection Networks. 359-385
  
• Emmanuel Lazard:
  Broadcasting in DMA-Bound Bounded Degree Graphs. 387-400
  
• Arthur L. Liestman, Joseph G. Peters:
  Minimum Broadcast Digraphs. 401-419
  
• Ueli M. Maurer:
  Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. 421-436
  
• Nicholas Pippenger:
  The Asymptotic Optimality of Spider-Web Networks. 437-450
  
• Ján Plesník:
  Heuristics for the Steiner Problem in Graphs. 451-463
  
• Arnold L. Rosenberg:
  Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. 465-488
  
• Douglas R. Shier, E. J. Valvo, Robert E. Jamison:
  Generating the States of a Binary Stochastic System. 489-500
  
• Patrick Solé, Arif Ghafoor, Sohail Sheikh:
  The Covering Radius of Hadamard Codes in Odd Graphs. 501-510
  
• Terunao Soneoka:
  Super Edge-Connectivity of Dense Digraphs and Graphs. 511-523
  
• Jorge Luis Villar:
  The Underlying Graph of a Line Digraph. 525-538
  
• Koichi Wada, Kimio Kawaguchi:
  Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. 539-552
  
• Gilles Zémor, Gérard D. Cohen:
  Application of Coding Theory to Interconnection Networks. 553-562
  
• Guy W. Zimmerman, Abdol-Hossein Esfahanian:
  Chordal Rings as Fault-Tolerant Loops. 563-573
  
• Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
  Table of Large (Delta, D)-Graphs. 575-577