Constructive Graph Labeling Using Double Cosets,
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1972
- Accession Number
- AD0755140
Entities
People
- Harold Brown
- Larry Hjelmeland
- Larry Masinter
Organizations
- Stanford University