44 resultados para RANDOM REGULAR GRAPHS
em University of Queensland eSpace - Australia
Resumo:
In this note strongly regular graphs with new parameters are constructed using nested "blown up" quadrics in projective spaces. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
We consider the construction of several configurations, including: • overlarge sets of 2-(11,5,2) designs, that is, partitions of the set of all 5-subsets of a 12-set into 72 2-(11,5,2) designs; • an indecomposable doubly overlarge set of 2-(11,5,2) designs, that is, a partition of two copies of the set of all 5-subsets of a 12-set into 144 2-(11,5,2) designs, such that the 144 designs can be arranged into a 12 × 12 square with interesting row and column properties; • a partition of the Steiner system S(5,6,12) into 12 disjoint 2-(11,6,3) designs arising from the diagonal of the square; • bidistant permutation arrays and generalized Room squares arising from the doubly overlarge set, and their relation to some new strongly regular graphs.
Resumo:
A perp-system R(r) is a maximal set of r-dimensional subspaces of PG(N,q) equipped with a polarity rho, such that the tangent space of an element of R(r) does not intersect any element of R(r). We prove that a perp-system yields partial geometries, strongly regular graphs, two-weight codes, maximal arcs and k-ovoids. We also give some examples, one of them yielding a new pg(8,20,2).
Resumo:
The circulant graph Sn, where S ⊆ Zn \ {0}, has vertex set Zn and edge set {{x, x + s}|x ∈ Zn, s ∈ S}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph Sn in which S has an element of order n.
Resumo:
We investigate here a modification of the discrete random pore model [Bhatia SK, Vartak BJ, Carbon 1996;34:1383], by including an additional rate constant which takes into account the different reactivity of the initial pore surface having attached functional groups and hydrogens, relative to the subsequently exposed surface. It is observed that the relative initial reactivity has a significant effect on the conversion and structural evolution, underscoring the importance of initial surface chemistry. The model is tested against experimental data on chemically controlled char oxidation and steam gasification at various temperatures. It is seen that the variations of the reaction rate and surface area with conversion are better represented by the present approach than earlier random pore models. The results clearly indicate the improvement of model predictions in the low conversion region, where the effect of the initially attached functional groups and hydrogens is more significant, particularly for char oxidation. It is also seen that, for the data examined, the initial surface chemistry is less important for steam gasification as compared to the oxidation reaction. Further development of the approach must also incorporate the dynamics of surface complexation, which is not considered here.
Resumo:
The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.
Resumo:
In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.
Resumo:
A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.
Resumo:
This article describes a method to turn astronomical imaging into a random number generator by using the positions of incident cosmic rays and hot pixels to generate bit streams. We subject the resultant bit streams to a battery of standard benchmark statistical tests for randomness and show that these bit streams are statistically the same as a perfect random bit stream. Strategies for improving and building upon this method are outlined.
Resumo:
A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.
Resumo:
Genetic markers that distinguish fungal genotypes are important tools for genetic analysis of heterokaryosis and parasexual recombination in fungi. Random amplified polymorphic DNA (RAPD) markers that distinguish two races of biotype B of Colletotrichum gloeosporioides infecting the legume Stylosanthes guianensis were sought. Eighty-five arbitrary oligonucleotide primers were used to generate 895 RAPD bands but only two bands were found to be specifically amplified from DNA of the race 3 isolate. These two RAPD bands were used as DNA probes and hybridised only to DNA of the race 3 isolate. Both RAPD bands hybridised to a dispensable 1.2 Mb chromosome of the race 3 isolate. No other genotype-specific chromosomes or DNA sequences were identified in either the race 2 or race 3 isolates. The RAPD markers hybridised to a 2 Mb chromosome in all races of the genetically distinct biotype A pathogen which infects other species of Stylosanthes as well as S. guianensis. The experiments indicate that RAPD analysis is a potentially useful tool for obtaining genotype-and chromosome-specific DNA probes in closely related isolates of one biotype of this fungal pathogen.
Resumo:
Necessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph K-r,K-s,K-t into exactly alpha 3-cycles and beta 4-cycles. (C) 1999 Elsevier Science B.V. All rights reserved.