Sciweavers

7 search results - page 1 / 2

» arscom 1999

5

ARSCOM
1999

57views more ARSCOM 1999»

On Complementary Consecutive Labelings of Octahedron

13 years 4 months ago

On Complementary Consecutive Labelings of Octahedron

Download lib.ck.tp.edu.tw

Qu Anjing

claim paper

Read More »

6

ARSCOM
1999

51views more ARSCOM 1999»

The Application of Determining Sets to Projective Configurations

13 years 4 months ago

The Application of Determining Sets to Projective Configurations

Download bkocay.cs.umanitoba.ca

William Kocay, Ryan Szypowski

claim paper

Read More »

5

ARSCOM
1999

59views more ARSCOM 1999»

Self-complementary circulant graphs

13 years 4 months ago

Self-complementary circulant graphs

Download www.cs.uleth.ca

Brian Alspach, Joy Morris, V. Vilfred

claim paper

Read More »

4

ARSCOM
1999

44views more ARSCOM 1999»

Bounds on the Total Redundance and Efficiency of a Graph

13 years 4 months ago

Bounds on the Total Redundance and Efficiency of a Graph

Download www.cs.clemson.edu

Wayne Goddard, Ortrud Oellermann, Peter J. Slater,...

claim paper

Read More »

4

ARSCOM
1999

57views more ARSCOM 1999»

Minimal Partitions of a Graph

13 years 4 months ago

Minimal Partitions of a Graph

Download www.math.siu.edu

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

claim paper

Read More »

« Prev « First page 1 / 2 Last » Next »