Journal of Combinatorial Designs最新文献_第7页

A generalization of group divisible t $t$ -designs 群可整除t$t$-设计的一个推广

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-08-10 DOI: 10.1002/jcd.21912

Sijia Liu, Yue Han, Lijun Ma, Lidong Wang, Zihong Tian

{"title":"A generalization of group divisible \u0000 \u0000 \u0000 t\u0000 \u0000 $t$\u0000 -designs","authors":"Sijia Liu, Yue Han, Lijun Ma, Lidong Wang, Zihong Tian","doi":"10.1002/jcd.21912","DOIUrl":"https://doi.org/10.1002/jcd.21912","url":null,"abstract":"Cameron defined the concept of generalized <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-designs, which generalized <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-designs, resolvable designs and orthogonal arrays. This paper introduces a new class of combinatorial designs which simultaneously provide a generalization of both generalized <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-designs and group divisible <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-designs. In certain cases, we derive necessary conditions for the existence of generalized group divisible <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-designs, and then point out close connections with various well-known classes of designs, including mixed orthogonal arrays, factorizations of the complete multipartite graphs, large sets of group divisible designs, and group divisible designs with (orthogonal) resolvability. Moreover, we investigate constructions for generalized group divisible <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-designs and almost completely determine their existence for <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 <mo>=</mo>\u0000 <mn>2</mn>\u0000 <mo>,</mo>\u0000 <mn>3</mn>\u0000 </mrow>\u0000 <annotation> $t=2,3$</annotation>\u0000 </semantics></math> and small block sizes.","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 11","pages":"575-603"},"PeriodicalIF":0.7,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50137077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Cameron–Liebler sets for maximal totally isotropic flats in classical affine spaces 经典仿射空间中最大全各向同性平面的Cameron–Liebler集

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-07-19 DOI: 10.1002/jcd.21909

Jun Guo, Lingyu Wan

{"title":"Cameron–Liebler sets for maximal totally isotropic flats in classical affine spaces","authors":"Jun Guo, Lingyu Wan","doi":"10.1002/jcd.21909","DOIUrl":"https://doi.org/10.1002/jcd.21909","url":null,"abstract":"Let <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>A</mi>\u0000 <mi>C</mi>\u0000 <mi>G</mi>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 <mi>ν</mi>\u0000 <mo>,</mo>\u0000 <msub>\u0000 <mi>F</mi>\u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $ACG(2nu ,{{mathbb{F}}}_{q})$</annotation>\u0000 </semantics></math> be the <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 <mi>ν</mi>\u0000 </mrow>\u0000 <annotation> $2nu $</annotation>\u0000 </semantics></math>-dimensional classical affine space with parameter <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>e</mi>\u0000 </mrow>\u0000 <annotation> $e$</annotation>\u0000 </semantics></math> over a <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>q</mi>\u0000 </mrow>\u0000 <annotation> $q$</annotation>\u0000 </semantics></math>-element finite field <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>F</mi>\u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${{mathbb{F}}}_{q}$</annotation>\u0000 </semantics></math>, and <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>O</mi>\u0000 <mi>ν</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${{mathscr{O}}}_{nu }$</annotation>\u0000 </semantics></math> be the set of all maximal totally isotropic flats in <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>A</mi>\u0000 <mi>C</mi>\u0000 <mi>G</mi>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 <mi>ν</mi>\u0000 <mo>,</mo>\u0000 <msub>\u0000 <mi>F</mi>\u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $ACG(2nu ,{{mathbb{F}}}_{q})$</annotation>\u0000 </semantics></math>. In this paper, we discuss Cameron–Liebler sets in <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>O</mi>\u0000 <mi>ν</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${{mathscr{O}}}_{nu }$</annotation>\u0000 </semantics></math>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 11","pages":"547-574"},"PeriodicalIF":0.7,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50137650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exceptional designs in some extended quadratic residue codes 一些扩展二次残差码的例外设计

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-07-18 DOI: 10.1002/jcd.21907

Reina Ishikawa

引用次数: 2

On the existence of k $k$ -cycle semiframes for even k $k$ 关于偶数k$k的k$k$-循环半帧的存在性$

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-07-13 DOI: 10.1002/jcd.21908

Li Wang, Haibo Ji, Haitao Cao

{"title":"On the existence of \u0000 \u0000 \u0000 k\u0000 \u0000 $k$\u0000 -cycle semiframes for even \u0000 \u0000 \u0000 k\u0000 \u0000 $k$","authors":"Li Wang, Haibo Ji, Haitao Cao","doi":"10.1002/jcd.21908","DOIUrl":"https://doi.org/10.1002/jcd.21908","url":null,"abstract":"A <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>C</mi>\u0000 <mi>k</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${C}_{k}$</annotation>\u0000 </semantics></math>-semiframe of type <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>g</mi>\u0000 <mi>u</mi>\u0000 </msup>\u0000 </mrow>\u0000 <annotation> ${g}^{u}$</annotation>\u0000 </semantics></math> is a <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>C</mi>\u0000 <mi>k</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${C}_{k}$</annotation>\u0000 </semantics></math>-group divisible design of type <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>g</mi>\u0000 <mi>u</mi>\u0000 </msup>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mi>X</mi>\u0000 <mo>,</mo>\u0000 <mi>G</mi>\u0000 <mo>,</mo>\u0000 <mi>ℬ</mi>\u0000 </mrow>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> ${g}^{u}({mathscr{X}},{mathscr{G}},{rm{ {mathcal B} }})$</annotation>\u0000 </semantics></math> in which <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>X</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{X}}$</annotation>\u0000 </semantics></math> is the vertex set, <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{G}}$</annotation>\u0000 </semantics></math> is the group set, and the set <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>ℬ</mi>\u0000 </mrow>\u0000 <annotation> ${rm{ {mathcal B} }}$</annotation>\u0000 </semantics></math> of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 <annotation> $k$</annotation>\u0000 </semantics></math>-cycles can be written as a disjoint union <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>ℬ</mi>\u0000 <mo>=</mo>\u0000 <mi>P</mi>\u0000 <mo>∪</mo>\u0000 <mi>Q</mi>\u0000 </mrow>\u0000 <annotation> ${rm{ {mathcal B} }}={mathscr{P}}cup {mathscr{Q}}$</annotation>\u0000 </semantics></math> where <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>P</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{P}}$</annotation>\u0000 </semantics></math> is partitioned into parallel classes","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 10","pages":"511-530"},"PeriodicalIF":0.7,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50131264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Totally symmetric quasigroups of order 16 16阶全对称拟群

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-07-13 DOI: 10.1002/jcd.21910

Hy Ginsberg

引用次数: 0

Enumerating Steiner triple systems Steiner三重系统的枚举

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-07-13 DOI: 10.1002/jcd.21906

Daniel Heinlein, Patric R. J. Östergård

引用次数: 0

Cycles of quadratic Latin squares and antiperfect 1-factorisations 二次拉丁平方的环与反完美1-因子分解

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-07-10 DOI: 10.1002/jcd.21905

Jack Allsop

{"title":"Cycles of quadratic Latin squares and antiperfect 1-factorisations","authors":"Jack Allsop","doi":"10.1002/jcd.21905","DOIUrl":"https://doi.org/10.1002/jcd.21905","url":null,"abstract":"A Latin square of order <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation> $n$</annotation>\u0000 </semantics></math> is an <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 \u0000 <mo>×</mo>\u0000 \u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation> $ntimes n$</annotation>\u0000 </semantics></math> matrix of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation> $n$</annotation>\u0000 </semantics></math> symbols, such that each symbol occurs exactly once in each row and column. For an odd prime power <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>q</mi>\u0000 </mrow>\u0000 <annotation> $q$</annotation>\u0000 </semantics></math> let <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>F</mi>\u0000 \u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${{mathbb{F}}}_{q}$</annotation>\u0000 </semantics></math> denote the finite field of order <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>q</mi>\u0000 </mrow>\u0000 <annotation> $q$</annotation>\u0000 </semantics></math>. A quadratic Latin square is a Latin square <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>L</mi>\u0000 \u0000 <mrow>\u0000 <mo>[</mo>\u0000 \u0000 <mrow>\u0000 <mi>a</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>b</mi>\u0000 </mrow>\u0000 \u0000 <mo>]</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> ${rm{ {mathcal L} }}[a,b]$</annotation>\u0000 </semantics></math> defined by\u0000\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 9","pages":"447-475"},"PeriodicalIF":0.7,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21905","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50127978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The chromatic index of finite projective spaces 有限射影空间的色指数

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-06-30 DOI: 10.1002/jcd.21904

Lei Xu, Tao Feng

{"title":"The chromatic index of finite projective spaces","authors":"Lei Xu, Tao Feng","doi":"10.1002/jcd.21904","DOIUrl":"https://doi.org/10.1002/jcd.21904","url":null,"abstract":"A line coloring of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>PG</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>q</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $text{PG}(n,q)$</annotation>\u0000 </semantics></math>, the <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation> $n$</annotation>\u0000 </semantics></math>-dimensional projective space over GF<math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>q</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation> $(q)$</annotation>\u0000 </semantics></math>, is an assignment of colors to all lines of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>PG</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>q</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $text{PG}(n,q)$</annotation>\u0000 </semantics></math> so that any two lines with the same color do not intersect. The chromatic index of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>PG</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>q</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $text{PG}(n,q)$</annotation>\u0000 </semantics></math>, denoted by <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>χ</mi>\u0000 \u0000 <mo>′</mo>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mtext>PG</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>n</mi>\u0000 \u0000 <mo>,</","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 9","pages":"432-446"},"PeriodicalIF":0.7,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50148157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Existence of small ordered orthogonal arrays 小有序正交阵列的存在性

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-06-19 DOI: 10.1002/jcd.21903

Kai-Uwe Schmidt, Charlene Weiß

引用次数: 0

Linear and circular single-change covering designs revisited 重新审视线性和圆形单次变更覆盖设计

IF 0.7 4区数学

Journal of Combinatorial Designs Pub Date : 2023-06-01 DOI: 10.1002/jcd.21885

Amanda Chafee, Brett Stevens

{"title":"Linear and circular single-change covering designs revisited","authors":"Amanda Chafee, Brett Stevens","doi":"10.1002/jcd.21885","DOIUrl":"https://doi.org/10.1002/jcd.21885","url":null,"abstract":"A single-change covering design (SCCD) is a <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>v</mi>\u0000 </mrow>\u0000 <annotation> $v$</annotation>\u0000 </semantics></math>-set <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>X</mi>\u0000 </mrow>\u0000 <annotation> $X$</annotation>\u0000 </semantics></math> and an ordered list <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>ℒ</mi>\u0000 </mrow>\u0000 <annotation> ${rm{ {mathcal L} }}$</annotation>\u0000 </semantics></math> of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>b</mi>\u0000 </mrow>\u0000 <annotation> $b$</annotation>\u0000 </semantics></math> blocks of size <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 <annotation> $k$</annotation>\u0000 </semantics></math> where every pair from <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>X</mi>\u0000 </mrow>\u0000 <annotation> $X$</annotation>\u0000 </semantics></math> must occur in at least one block. Each pair of consecutive blocks differs by exactly one element. This is a linear single-change covering design, or more simply, a single-change covering design. A single-change covering design is circular when the first and last blocks also differ by one element. A single-change covering design is minimum if no other smaller design can be constructed for a given <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>v</mi>\u0000 <mo>,</mo>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 <annotation> $v,k$</annotation>\u0000 </semantics></math>. In this paper, we use a new recursive construction to solve the existence of circular SCCD(<math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>v</mi>\u0000 <mo>,</mo>\u0000 <mn>4</mn>\u0000 <mo>,</mo>\u0000 <mi>b</mi>\u0000 </mrow>\u0000 <annotation> $v,4,b$</annotation>\u0000 </semantics></math>) for all <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>v</mi>\u0000 </mrow>\u0000 <annotation> $v$</annotation>\u0000 </semantics></math> and three residue classes of circular SCCD(<math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>v</mi>\u0000 <mo>,</mo>\u0000 <mn>5</mn>\u0000 <mo>,</mo>\u0000 <mi>b</mi>\u0000 </mrow>\u0000 <annotation> $v,5,b$</annotation>\u0000 </semantics","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 9","pages":"405-421"},"PeriodicalIF":0.7,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21885","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50116119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0