2001-05: Distribution of Distances in Star Graphs

DIMACS TR: 2001-05

Distribution of Distances in Star Graphs

Authors: Italo J. Dejter

ABSTRACT
The distribution of distances in the star graph ST_n, where n is an integer >1, is determined from any fixed vertex, in particular to the vertices of each one of the n so-called efficient dominating sets, or 1-perfect codes.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-05.ps.gz

DIMACS Home Page