Characterization of group-divisible designs and some related results
Technical Report
·
OSTI ID:7073046
A regular graph is a graph with no multiple edges and loops such that each of its vertices is adjacent (or connected) to the same number of other vertices. The optimality of some special types of regular graph designs for the elimination of one-way heterogeneity has already been proven. The main purpose of this work is to show that these designs are group-divisible. The problem is formulated and solved in the context of graph theory. (RWR)
- Research Organization:
- California Univ., Berkeley (USA); Union Carbide Corp., Oak Ridge, TN (USA). Computer Sciences Div.
- DOE Contract Number:
- W-7405-ENG-26
- OSTI ID:
- 7073046
- Report Number(s):
- TID-28464
- Country of Publication:
- United States
- Language:
- English
Similar Records
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)
Modeling, Simulation Design and Control of Hybrid-Electric Vehicle Drives
Foundation Heat Exchanger Final Report: Demonstration, Measured Performance, and Validated Model and Design Tool
Technical Report
·
Fri Nov 29 00:00:00 EST 2019
·
OSTI ID:7073046
Modeling, Simulation Design and Control of Hybrid-Electric Vehicle Drives
Technical Report
·
Fri Sep 30 00:00:00 EDT 2005
·
OSTI ID:7073046
Foundation Heat Exchanger Final Report: Demonstration, Measured Performance, and Validated Model and Design Tool
Technical Report
·
Sun Jan 01 00:00:00 EST 2012
·
OSTI ID:7073046