简介：枚举盖住设计的图的几种类型的同晶型班是在计算的拓扑的图理论的中央研究话题之一。如果它的盖住的图是circulant，G盖住的A被称为circulant。最近，作者[分离数学，277，73鈥?5(2004)]枚举circulant的同晶型班某个类型的两倍覆盖物，叫了典型盖住，并且证明两倍原子价三的一张circulant图盖住都不是circulant。另外，在里面[图和组合数学，21，386鈥?00(2005)]，circulant的同晶型班加倍原子价的一张circulant图的覆盖物四被枚举。在这篇论文，circulant的同晶型班加倍原子价的一张circulant图的覆盖物五被枚举。盖住的关键词图-电压赋值-Cayley-circulant图先生(2000)题目分类05C10-第一写作的05C30被中国(号码60473019和10571005)的NSF并且由NKBRPC(2004CB318000)支持，并且第二个作者被Com2MaC鈥揔OSEF在朝鲜支持

简介：<正>Inthispaper,wecompletelydeterminetheconnectivityofeveryinfinitecirculantdigraphsandprovethatalmostallinfinitecirculantdigraphsareinfinitelystronglyconnectedandthereforehavebothone-andtwo-wayinfiniteHamiltonianpaths.

简介：ＯｎｔｈｅＣｉｒｃｕｌａｎｔａｎｄＡｐｅｒｉｏｄｉｃＭｏｄｅｌｓｏｆＤｅｃｏｎｖｏｌｕｔｉｏｎ￥ＺｏｕＭｏｕｙａｎ＆ＲｏｌｆＵｎｂｅｈａｕｅｎＡｂｓｔｒａｃｔ：Ｔｈｅｐｏｐｕｌａｒｌｙｕｓｅｄｃｉｒｃｕｌａｎｔｍａｔｒｉｘｍｏｄｅｌｏｆｄｅｃｏｎｖｏ...

简介：ＯＮＡＲＣ┐ＴＲＡＮＳＩＴＩＶＥＣＩＲＣＵＬＡＮＴＤＩＧＲＡＰＨＳＨＵＡＮＧＱＩＯＮＧＸＩＡＮＧＡｂｓｔｒａｃｔ．ＤｅｎｏｔｅｂｙＣｎ（Ｓ）ｔｈｅｃｉｒｃｕｌａｎｔｄｉｇｒａｐｈｗｉｔｈｖｅｒｔｅｘｓｅｔＺｎ＝｛０，１，２，．．．，ｎ－１｝ａｎｄｓｙ...

简介：Abstract.Inthispaper,weintroduceanewapproachtocharacterizetheisomor-phismsofcirculantdigraphs.Intermsofthismethod,wecompletelydeterminetheisomorphicclassesofcirculantdigraphsofdegree3.Inpsrticular,wecharacterizethosecirculantdigraphsofdegree3whichdon''tsatisfyJkdAm''sconjectttre.

简介：

简介：Inthispaper,algorithmsforfindingtheinverseofafactorblockcirculantmatrix,afactorblockretrocirculantmatrixandpartitionedmatrixwithfactorblockcirculantblocksoverthecomplexfieldarepresentedrespectively.Inaddition,twoalgorithmsfortheinverseofafactorblockcirculantmatrixoverthequaterniondivisionalgebraareproposed.

简介：让Gn(C)是概括circulant的三明治semigroup有三明治矩阵C和GC(Jn)的布尔矩阵在Gn(C)的所有原始矩阵的集合。在这份报纸，为在原始的semigroupGn(C)的A的一些必要、足够的条件被给。我们也证明GC(Jn)是Gn(C)的subsemigroup。

简介：AclassofQuasi-SystematicBlock-CirculantLow-DensityParity-Check(QSBC-LDPC)codesisproposed.Block-circulantLDPCcodeshavebeenstudiedalotrecently,becausethesimplestructuresoftheirparity-checkmatricesareveryhelpfultoreducetheimplementationcomplexities.QSBC-LDPCcodesarespecialblock-circulantLDPCcodeswithquasi-systematicparity-checkma-trices.ThememoriesforencodersofQSBC-LDPCcodesarelimited,andtheencodingprocesscanbecarriedoutinasimplerecursivewaywithlowcomplexities.ResearchesshowthattheQSBC-LDPCcodescanprovideremarkableperformanceswithlowencodingcomplexities.