Sciweavers

7 search results - page 1 / 2
» arscom 1999
Sort
View
74
Voted
ARSCOM
1999
57views more  ARSCOM 1999»
15 years 1 months ago
On Complementary Consecutive Labelings of Octahedron
Qu Anjing
68
Voted
ARSCOM
1999
51views more  ARSCOM 1999»
15 years 1 months ago
The Application of Determining Sets to Projective Configurations
William Kocay, Ryan Szypowski
ARSCOM
1999
59views more  ARSCOM 1999»
15 years 1 months ago
Self-complementary circulant graphs
Brian Alspach, Joy Morris, V. Vilfred
69
Voted
ARSCOM
1999
44views more  ARSCOM 1999»
15 years 1 months ago
Bounds on the Total Redundance and Efficiency of a Graph
Wayne Goddard, Ortrud Oellermann, Peter J. Slater,...
84
Voted
ARSCOM
1999
57views more  ARSCOM 1999»
15 years 1 months ago
Minimal Partitions of a Graph
For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,
Thomas Dale Porter