Báo cáo toán học: "Recognizing circulant graphs in polynomial time: An application of association schemes" pot

... of combinatorics 8 (2001), #R26 24 for the input graph G. Summarizing we can now state the main result of our paper in the following theorem. Theorem. Geometric circulants can be recognized in ... which cannot happen for a gc-graph. In all other cases, Algorithm 2 yields a Cayley numbering the electronic journal of combinatorics 8 (2001), #R26 20 Recognizing circulant graphs...

Ngày tải lên: 07/08/2014, 06:22

... is an automorphism of G. Cayley graphs, and in particular, circulant graphs have been studied intensively in the literature. These graphs are easily seen to be vertex transitive. In the case of ... groups of order n. In the special case of circulant graphs, or in any other case where the group G is given, we could recognize Cayley graphs by checking all differen...

Ngày tải lên: 07/08/2014, 06:22

... − 1 2 . In a certain (rather narrow) range of m, n and in the particular case of R induced by an injective mapping, Theorem 3 improves Theorem 1. To deal with the generalization of the most important ... is induced by an injective mapping and the sum m + n only slightly exceeds q. Theorem 3. Let A, B ⊆ G be subsets of a finite group G of order q = |G|, and let τ : A → B be a...

Ngày tải lên: 07/08/2014, 06:20

... (n i ,d,)- expander,  and d are constants independent of n i ,andthen i tend to in nity in i. Graphs with these properties are the principal combinatorial elements featured in many pseudorandom constructions. the ... journal of combinatorics 11 (2004), #R62 3 Random Cayley graphs are expanders: a simple proof of the Alon–Roichman theorem ZEPH LANDAU Department of Mathematic...

Ngày tải lên: 07/08/2014, 08:20

... acceptance. It can be downloaded, printed and distributed freely for any purposes (see copyright notice below). For information about publishing your research in Communications in Mobile Computing ... with the same group of individuals. These results indicate that user segmentation shall be necessary for an accurate inclusion of users’ expectations, as described in [3]. Taking int...

Ngày tải lên: 20/06/2014, 21:20

... beginning of slight increase. However, a significant enhancement in PSSHG occurs for the nanocrystal. The qualitative and quantitative changes that occurred for the nanocrystal correspond to the manifestation ... refractive indices for the pumping and PSSHG doubled frequencies, v ijk are the components of the second-order nonlinear optical susceptibility determined from different angle...

Ngày tải lên: 22/06/2014, 01:20

... Groneberg-Kloft B: Density-equalizing mapping and scientometric benchmarking in Industrial Health. Ind Health 2010, 48:197-203. 40. Groneberg-Kloft B, Quarcoo D, Scutaru C: Quality and quantity indices in science: ... substantial contributions to the conception and design of the review, acquisition of the review data and have been involved in drafting and revising the manuscript. Al...

Ngày tải lên: 20/06/2014, 00:20

... various unitary circulant graphs. In partic- ular, it allows us to generalize to unitary circulant graphs on Dedekind rings. Definition 4.6. A Dedekind domain ([3]) is an integral domain R such that (1) ... maximum lengh of a cycle in unit circulant graphs on a Dedekind domain quotiented by an ideal with r distinct maximal factors. Dedekind domains are exactly those integr...

Ngày tải lên: 07/08/2014, 13:21

... distinct endpoint not in S and of a colour different to that of any edge incident with a vertex of SMALL. This set of edges contains at least |M|/k colours. If M contains t edges of colour i and ... matchings and Hamiltonian cycles in random graphs. Annals of Discrete Mathematics 28 (1985) 23-46. [6] B. Bollob´as, T.I. Fenner and A.M. Frieze. An algorithm for finding Hamilton...

Ngày tải lên: 07/08/2014, 06:20

... endpoint to the corresponding endpoint in level i − 1. Similarly, if an endpoint in level i has no surrounding circle then there is an edge going from such an endpoint to a corresponding endpoint ... 3,z), (3, 1,z), and (3, 3,z)thespines of the graph. Consider the sum S of the degrees in P of the vertices along the spines. Since P can contain at most k edges from each spine,...

Ngày tải lên: 07/08/2014, 07:21