Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Discrete Mathematics and Combinatorics
Review Of “Linear Programming And Related Problems” By E. Nering And A. W. Tucker, Stephen B. Maurer
Review Of “Linear Programming And Related Problems” By E. Nering And A. W. Tucker, Stephen B. Maurer
Mathematics & Statistics Faculty Works
No abstract provided.
Partial Difference Sets In P-Groups, James A. Davis
Partial Difference Sets In P-Groups, James A. Davis
Department of Math & Statistics Faculty Publications
Most of the examples of PDS have come in p-groups, and most of these examples are in elementary abelian p-groups. In this paper, we will show an exponent bound for PDS with the same parameters as the elementary abelian case.
Average Genus Of The Cube, Jody Koenemann
Average Genus Of The Cube, Jody Koenemann
Honors Theses
In recent years, there has been interest in the mathematical community in a rapidly developing branch of theoretical mathematics known as random topological graph theory. This new area of mathematics explores the different ways in which certain graphs can be imbedded in given surfaces. The random nature of the new branch results when one also imposes a random distribution on set of all imbeddings of a fixed graph, via the orientation of the edges at each vertex. Using the technique of J. Edmonds, developed in 1960, this paper explores the imbeddings for the graph Q3 using a particular group …
Third Order Degree Regular Graphs, Leslie D. Hayes
Third Order Degree Regular Graphs, Leslie D. Hayes
Honors Theses
A graph G is regular of degree d if for every vertex v in G there exist exactly d vertices at distance 1 from v. A graph G is kth order regular of degree d if for every vertex v in G, there exist exactly d vertices at distance k from v. In this paper, third order regular graphs of degree 1 with small order are characterized.
A Construction Of Difference Sets In High Exponent 2-Groups Using Representation Theory, James A. Davis, Ken Smith
A Construction Of Difference Sets In High Exponent 2-Groups Using Representation Theory, James A. Davis, Ken Smith
Department of Math & Statistics Faculty Publications
Nontrivial difference sets in groups of order a power of 2 are part of the family of difference sets called Menon difference sets (or Hadamard), and they have parameters (22d+2, 22d+1 ±2d, 22d±2d). In the abelian case, the group has a difference set if and only if the exponent of the group is less than or equal to 2d+2. In [14], the authors construct a difference set in a nonabelian group of order 64 and exponent 32. This paper generalizes that result to …
Fault-Tolerant Circuit-Switching Networks, Nicholas Pippenger, Geng Lin
Fault-Tolerant Circuit-Switching Networks, Nicholas Pippenger, Geng Lin
All HMC Faculty Publications and Research
The authors consider fault-tolerant circuit-switching networks under a random switch failure model. Three circuit-switching networks of theoretical importance—nonblocking networks, rearrangeable networks, and superconcentrators—are studied. The authors prove lower bounds for the size (the number of switches) and depth (the largest number of switches on a communication path) of such fault-tolerant networks and explicitly construct such networks with optimal size Θ( n (log n)2 ) and depth Θ( log n ).