Accession Number:

AD0755140

Title:

Constructive Graph Labeling Using Double Cosets,

Descriptive Note:

Corporate Author:

STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Report Date:

1972-10-01

Pagination or Media Count:

48.0

Abstract:

Two efficient computer implemented algorithms are presented for explicitly constructing all distinct labelings of a graph G with a set of not necessarily distinct labels L, given the symmetry group B of G. Two recursive reductions of the problem and a precomputation involving certain orbits of stabilizer subgroups are the techniques used by the algorithm. Moreover, for each labeling, the subgroup of B which preserves that labeling is calculated. Author

Subject Categories:

  • Theoretical Mathematics
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE