نتایج جستجو برای: resolvable topological generalizad group

تعداد نتایج: 1044833  

Journal: :EURASIP Journal on Advances in Signal Processing 2022

Abstract Current resolvable group targets tracking algorithms can only track a small number of assuming the standard deviation vectors (SDVs) are known. Based on generalized labeled multi-Bernoulli filter, this paper first proposes serial algorithm, in order to save computational cost filter large-batch and multi-structure targets. Then, least squares k -means used jointly estimate SDVs target ...

Journal: :iranian journal of mathematical chemistry 2010
g. h. fath–tabar a. azad n. elahinezhad

topological indices are numerical parameters of a graph which characterize its topology. inthis paper the pi, szeged and zagreb group indices of the tetrameric 1,3–adamantane arecomputed.

Journal: :sahand communications in mathematical analysis 0
kazem haghnejad azar department of mathematics, university of mohaghegh ardabili, ardabil, iran.

in this paper, we  study the arens regularity properties of module actions. we investigate some properties of topological centers of module actions ${z}^ell_{b^{**}}(a^{**})$ and  ${z}^ell_{a^{**}}(b^{**})$ with some conclusions in group algebras.

Journal: :SIAM J. Discrete Math. 2009
A. J. Wolfe Alan C. H. Ling Jeffrey H. Dinitz

An N2 resolvable latin squares is a latin square with no 2×2 subsquares that also has an orthogonal mate. In this paper we show that N2 resolvable latin squares exist for all orders n with n 6= 2, 4, 6, 8

2003
Miwako Mishima Hung-Lin Fu

In this article, necessary and sufficient conditions for the existence of a 1rotationally resolvable even-cycle system of kKv are given, which are eventually for the existence of a resolvable even-cycle system of kKv . # 2003 Wiley Periodicals, Inc. J Combin Designs 11: 394–407, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10058

Journal: :Discrete Mathematics 1999
Willem H. Haemers

For prime power q, we determine the minimum number of parallel classes in a resolvable 2-(kq, L 1) covering for almost all values of k. @ 1999 Elsevier Science B.V. All rights reserved In September 1995 Jan van Haastrecht gave a dinner on the occasion of his retirement. He had invited 20 colleagues. The host and the guests were to be seated at three tables each of which had seven places. The di...

2010
Shubo Chen Jianguang Yang J. Yang

Abstract The m-order connectivity index mχ(G) of an organic molecule whose molecular graph is G is the sum of the weights (di1di2 · · · dim+1) 1 2 , where di1di2 · · · dim+1 runs over all paths of length m in G and di denotes the degree of vertex vi. Dendrimer is a polimer molecule with a distinctive structure that resembles the crown of a tree. Dendrimers are key molecules in nanotechnology an...

2016
L. J. Cornelissen K. J. H. Peters G. E. W. Bauer R. A. Duine B. J. van Wees

L. J. Cornelissen,1,* K. J. H. Peters,2 G. E. W. Bauer,3,4 R. A. Duine,2,5 and B. J. van Wees1 1Physics of Nanodevices, Zernike Institute for Advanced Materials, University of Groningen, Nijenborgh 4, 9747 AG Groningen, The Netherlands 2Institute for Theoretical Physics and Center for Extreme Matter and Emergent Phenomena, Utrecht University, Leuvenlaan 4, 3584 CE Utrecht, The Netherlands 3Inst...

Journal: :Discrete Mathematics 2004
Kai-Tai Fang Xuan Lu Yu Tang Jianxing Yin

In this paper, uniform designs are constructed based on nearly U-type designs and the discrete discrepancy. The link between such uniform designs and resolvable packings and coverings in combinatorial design theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید