关于图的布尔维数和其他相关参数

Discret. Math. Theor. Comput. Sci. Pub Date : 2021-05-01 DOI:10.46298/dmtcs.7437

M. Pouzet, H. S. Kaddour, Bhalchandra D. Thatte

{"title":"关于图的布尔维数和其他相关参数","authors":"M. Pouzet, H. S. Kaddour, Bhalchandra D. Thatte","doi":"10.46298/dmtcs.7437","DOIUrl":null,"url":null,"abstract":"We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a certain star decomposition. We relate the Boolean dimension with the inversion index of a tournament.","PeriodicalId":110830,"journal":{"name":"Discret. Math. Theor. Comput. Sci.","volume":"96 3 Pt 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On the Boolean dimension of a graph and other related parameters\",\"authors\":\"M. Pouzet, H. S. Kaddour, Bhalchandra D. Thatte\",\"doi\":\"10.46298/dmtcs.7437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a certain star decomposition. We relate the Boolean dimension with the inversion index of a tournament.\",\"PeriodicalId\":110830,\"journal\":{\"name\":\"Discret. Math. Theor. Comput. Sci.\",\"volume\":\"96 3 Pt 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Math. Theor. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/dmtcs.7437\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Math. Theor. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/dmtcs.7437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

给出了图的布尔维数，并将其与内维数、几何维数和辛维数以及图的秩和最小秩的概念联系起来。我们根据某一星形分解得到了树的布尔维数的精确公式。我们将布尔维与锦标赛的倒排索引联系起来。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the Boolean dimension of a graph and other related parameters

We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a certain star decomposition. We relate the Boolean dimension with the inversion index of a tournament.

求助全文

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

来源期刊

Discret. Math. Theor. Comput. Sci.

自引率

0.00%

发文量