Classification and Enumeration of Minimum (d,3,3)-Graphs for Odd d.

Abstract

A (d,c,v)-graph is a c-connected graph of diameter d in which each node is of valence v. A minimum (d,c,v)-graph is one with the minimum number of nodes. Each minimum (d,c,v)-graph corresponds to an efficient way of arranging the stations of a communication network so that if any c-1 stations are incapacitated, the rest of the network is still connected, and so that in case of breakdown or other difficulty each station can rely for assistance on precisely v others. Here the minimum (d,3,3)-graphs are classified and counted for odd d. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1976
Accession Number
ADA033578

Entities

People

  • Victor Klee

Organizations

  • University of Washington

Tags

Communities of Interest

  • Counter IED

DTIC Thesaurus Topics

  • Classification
  • Communication Networks
  • Diameters
  • Eigenvalues
  • Equations
  • Identification
  • Identities
  • Mathematics
  • Military Research
  • Networks
  • Reversible
  • Sequences
  • Specifications
  • United States
  • United States Government
  • Universities

Readers

  • Computer Networking
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design