论超立方体幂中的最大簇

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-01-27 DOI:10.1142/s0219265923500366

Yanting Hu, Weihua Yang

{"title":"论超立方体幂中的最大簇","authors":"Yanting Hu, Weihua Yang","doi":"10.1142/s0219265923500366","DOIUrl":null,"url":null,"abstract":"Finding the values of [Formula: see text] and [Formula: see text] is a fundamental problem in classical coding theory. The [Formula: see text] is the size of the maximum independent set of [Formula: see text] which is the induced subgraph of vectors of weight [Formula: see text] of the [Formula: see text]-power of [Formula: see text]-dimensional hypercubes. Obviously, [Formula: see text]. In order to further understand and study the independent set of [Formula: see text], we explore its clique number and the structure of the maximum clique. In this paper, we obtain the clique number and the structure of the maximum clique of [Formula: see text] for [Formula: see text] As an application, by [Formula: see text] we obtain the upper bounds of [Formula: see text] for [Formula: see text]","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Maximum Cliques in Powers of Hypercubes\",\"authors\":\"Yanting Hu, Weihua Yang\",\"doi\":\"10.1142/s0219265923500366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding the values of [Formula: see text] and [Formula: see text] is a fundamental problem in classical coding theory. The [Formula: see text] is the size of the maximum independent set of [Formula: see text] which is the induced subgraph of vectors of weight [Formula: see text] of the [Formula: see text]-power of [Formula: see text]-dimensional hypercubes. Obviously, [Formula: see text]. In order to further understand and study the independent set of [Formula: see text], we explore its clique number and the structure of the maximum clique. In this paper, we obtain the clique number and the structure of the maximum clique of [Formula: see text] for [Formula: see text] As an application, by [Formula: see text] we obtain the upper bounds of [Formula: see text] for [Formula: see text]\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-01-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265923500366\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265923500366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

寻找[公式：见正文]和[公式：见正文]的值是经典编码理论中的一个基本问题。公式：见正文]是[公式：见正文]的最大独立集的大小，而[公式：见正文]是[公式：见正文]维超立方体的幂[公式：见正文]权重向量的诱导子图。显然，[公式：见正文]。为了进一步理解和研究[式：见正文]的独立集，我们探讨了它的小集团数和最大小集团的结构。在本文中，我们得到了[公式：见正文]的[公式：见正文]的簇数和[公式：见正文]的最大簇结构作为应用，通过[公式：见正文]我们得到了[公式：见正文]的[公式：见正文]的上界

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Maximum Cliques in Powers of Hypercubes

Finding the values of [Formula: see text] and [Formula: see text] is a fundamental problem in classical coding theory. The [Formula: see text] is the size of the maximum independent set of [Formula: see text] which is the induced subgraph of vectors of weight [Formula: see text] of the [Formula: see text]-power of [Formula: see text]-dimensional hypercubes. Obviously, [Formula: see text]. In order to further understand and study the independent set of [Formula: see text], we explore its clique number and the structure of the maximum clique. In this paper, we obtain the clique number and the structure of the maximum clique of [Formula: see text] for [Formula: see text] As an application, by [Formula: see text] we obtain the upper bounds of [Formula: see text] for [Formula: see text]

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-

自引率

14.30%

发文量

121

期刊介绍： The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.