Clark, W. Edwin - Department of Mathematics, University of South Florida

Advanced Search

Clark, W. Edwin - Department of Mathematics, University of South Florida

SEPARATING SETS WITH PARALLEL CLASSES OF HYPERPLANES
Upper Bounds for the Domination Number of a Graph W. Edwin Clark, Boris Shekhtman, Stephen Suen
COVERING BY COMPLEMENTS OF SUBSPACES W. Edwin Clark and Boris Shekhtman
Results from MathSciNet: Mathematical Reviews on the Web Copyright American Mathematical Society 2001
Elementary Abstract Algebra W. Edwin Clark
A Note on Minimal Boolean Formula Size of One-Dimensional Cellular Automataa
COVERING BY COMPLEMENTS OF SUBSPACES, II W. Edwin Clark and Boris Shekhtman
Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II
Inequalities Involving Gamma and Psi W. Edwin Clark and Mourad E.H. Ismail \Lambda
On the probability that a tsubset of a finite vector space contains an rsubspace--with
The Domination Numbers of the 5 \Theta n and 6 \Theta n Grid Graphs
Elementary Number Theory W. Edwin Clark
Domination Numbers of Complete Grid Graphs, I Tony Yu Chang
BINOMIAL AND QBINOMIAL COEFFICIENT INEQUALITIES RELATED TO THE HAMILTONICITY OF
Application of Upper and Lower Bounds for the Domination Number to Vizing's
THE AFFINITY OF A PERMUTATION OF A FINITE VECTOR SPACE
MATCHING SUBSPACES WITH COMPLEMENTS IN FINITE VECTOR SPACES
AN APPLICATION OF SPANNING TREES TO KPOINT SEPARATING FAMILIES OF FUNCTIONS
Elementary Abstract Algebra W. Edwin Clark
DOMINATION NUMBERS OF QANALOGUES OF KNESER GRAPHS
TIGHT UPPER BOUNDS FOR THE DOMINATION NUMBERS OF GRAPHS WITH GIVEN ORDER AND MINIMUM DEGREE
AN INEQUALITY RELATED TO VIZING'S W. EDWIN CLARK AND STEPHEN SUEN
1 Crystal Engineering Using a "Turtlebug" Algorithm: A de Novo 2 Approach to the Design of Binodal MetalOrganic Frameworks