5,848 research outputs found
A complete solution to the spectrum problem for graphs with six vertices and up to nine edges
Let be a graph. A -design of order is a decomposition of the complete graph into disjoint copies of . The existence problem of graph designs has been completely solved for all graphs with up to five vertices, and all graphs with six vertices and up to seven edges; and almost completely solved for all graphs with six vertices and eight edges leaving two cases of order 32 unsettled. Up to isomorphism there are 20 graphs with six vertices and nine edges (and no isolated vertex). The spectrum problem has been solved completely for 11 of these graphs, and partially for 2 of these graphs. In this article, the two missing graph designs for the six-vertex eight-edge graphs are constructed, and a complete solution to the spectrum problem for the six-vertex nine-edge graphs is given; completing the spectrum problem for all graphs with six vertices and up to nine edges
Recommended from our members
Designs for graphs with six vertices and nine edges
The design spectrum has been determined for eleven of the 21 graphs with six vertices and nine edges. In this paper we completely solve the design spectrum problem for the remaining ten graphs
Geometric auxetics
We formulate a mathematical theory of auxetic behavior based on one-parameter
deformations of periodic frameworks. Our approach is purely geometric, relies
on the evolution of the periodicity lattice and works in any dimension. We
demonstrate its usefulness by predicting or recognizing, without experiment,
computer simulations or numerical approximations, the auxetic capabilities of
several well-known structures available in the literature. We propose new
principles of auxetic design and rely on the stronger notion of expansive
behavior to provide an infinite supply of planar auxetic mechanisms and several
new three-dimensional structures
Graph isomorphism and genotypical houses
This paper will introduce a new method, known as small graph matching, anddemonstrate how it may be used to determine the genotype signature of a sample ofbuildings. First, the origins of the method and its relationship to other ?similarity? testingtechniques will be discussed. Then the range of possible actions and transformations willbe established through the creation of a set of rules. Next, in order to fully explain thismethod, a technique of normalizing the similarity measure is presented in order to permitthe comparison of graphs of differing magnitude. The last stage of this method ispresented, this being the comparison of all possible graph-pairs within a given sampleand the mean-distance calculated for all individual graphs. This results in theidentification of a genotype signature. Finally, this paper presents an empiricalapplication of this method and shows how effective it is, not only for the identification ofa building genotype, but also for assessing the homogeneity of a sample or sub-samples
Singularity classification as a design tool for multiblock grids
A major stumbling block in interactive design of 3-D multiblock grids is the difficulty of visualizing the design as a whole. One way to make this visualization task easier is to focus, at least in early design stages, on an aspect of the grid which is inherently easy to present graphically, and to conceptualize mentally, namely the nature and location of singularities in the grid. The topological behavior of a multiblock grid design is determined by what happens at its edges and vertices. Only a few of these are in any way exceptional. The exceptional behaviors lie along a singularity graph, which is a 1-D construct embedded in 3-D space. The varieties of singular behavior are limited enough to make useful symbology on a graphics device possible. Furthermore, some forms of block design manipulation that appear appropriate to the early conceptual-modeling phase can be accomplished on this level of abstraction. An overview of a proposed singularity classification scheme and selected examples of corresponding manipulation techniques is presented
- …